Handbook of finite fields (Q2841743)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Handbook of finite fields |
scientific article; zbMATH DE number 6192333
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Handbook of finite fields |
scientific article; zbMATH DE number 6192333 |
Statements
29 July 2013
0 references
0 references
0 references
Handbook of finite fields (English)
0 references
This is a brilliant monumental work on the state-of-the-art in theory and applications of finite fields. It's a must for everyone doing research in finite fields and their related areas. The contents is best described by citing from the editors' excellent preface.NEWLINENEWLINE The \textit{Handbook} is organized into three parts. Part I contains two chapters, the first one which is devoted to the history of finite fields through the 18th and 19th centuries by \textit{Roderick Gow} (3--11), and the second which gives an ``Introduction to finite fields'', written by the editors \textit{Gary L. Mullen} and \textit{Daniel Panario} (13--49), providing the basic properties of finite fields used in various places throughout the entire \textit{Handbook}. Mention should be made of a rather extensive list of recent finite-field related books, including textbooks as well as books dealing with theoretical and applied topics, the latter mainly related to combinatorics, coding theory and cryptography. A list of recent finite-field related conference proceedings volumes is also given. Finally, Section 2.2 by \textit{David Thomson} entitled Tables, contains several tables of polynomials of interest in computational issues. Note that the website \url{http://www.crcpress.com/product/isbn/9781439873786} provides larger and more extensive versions of the tables presented here. {Note: The preface claims Ch. 2 to belong to Part II, whereas the book itself treats it as chapter of Part I.}NEWLINENEWLINENEWLINENEWLINEPart II: Theoretical properties opens with Ch. 3 on ``Irreducible polynomials'' (53--85), containing subsections on ``Counting irreducible polynomials'' by \textit{Joseph L. Yucas}, on ``Construction of irreducibles'' by \textit{Melsik Kyuregyan}, on ``Conditions for reducible polynomials by \textit{Daniel Panario}, on ``Weights of irreducible polynomials'' by \textit{Omran Ahmadi}, on ``Prescribed coefficients'' by \textit{Stephen D. Cohen}, and finally on ``Multivariate polynomials'' by \textit{Xiang-dong Hou}.NEWLINENEWLINENEWLINENEWLINEThe fourth chapter, ``Primitive polynomials'' (87--99), gives an ``Introduction to primitive polynomials'' by \textit{Gary L. Mullen} and \textit{Daniel Panario}, and further treats topics like ``Prescribed coefficients'' by \textit{Stephen D. Cohen}, ``Weights of primitive polynomials'' by \textit{Stephen D. Cohen}, ``Elements of high order'' by \textit{Jose Felipe Voloch}.NEWLINENEWLINENEWLINE NEWLINEThe next two chapters deal with polynomials such as irreducible and primitive polynomials over finite fields. Ch. 5 ``Bases'' (101--138), discusses various kinds of bases over finite fields, and Ch. 6 (139--192), discusses ``Character and exponential sums'' over finite fields. Ch. 5 starts with ``Duality theory of bases'' by \textit{Dieter Jungnickel}, then discusses ``Normal bases'' by \textit{Shuhong Gao} and \textit{Qunying Liao}, ``Complexity of normal bases'' by \textit{Shuhong Gao} and \textit{David Thomson}, and finally ``Completely normal bases'' by \textit{Dirk Hachenberger}. Ch. 6 opens with a section on ``Gauss, Jacobi, and Kloosterman sums'' by \textit{Ronald J. Evans}. ``More general exponential and character sums'' are discussed by \textit{Antonio Rojas-Leon}, and ``Some applications of character sums'' by \textit{Alina Ostafe} and \textit{Arne Winterhof}. Also included is a relatively new topic as ``Sum-product theorems and applications'' by\textit{Moubariz Z. Garaev}.NEWLINENEWLINENEWLINEIn Chapter 7, ``Equations over finite field'' (193--213), results on solutions of equations over finite fields are discussed. First ``General forms'' are discussed by NEWLINE\textit{Daqing Wan}, then ``Quadratic forms'' by \textit{Robert Fitzgerald}, and finally ``Diagonal equations'' by \textit{Francis Castro} and \textit{Ivelisse Rubio}.NEWLINENEWLINE NEWLINECh. 8 ``Permutation polynomials'' (215--240), covers permutation polynomials in ``One variable'' by \textit{Gary L. Mullen} and \textit{Qiang Wang} and ``Several variables'' by \textit{Rudolf Lidl} and \textit{Gary L. Mullen}, as well as a discussion of ``Value sets of polynomials'' by \textit{Gary L. Mullen} and \textit{Michael E. Zieve}, and ``Exceptional polynomials'' over finite fields by \textit{Michael E. Zieve}.NEWLINENEWLINE NEWLINECh. 9 considers ``Special functions over finite fields'' (241--302). The discussion includes Boolean functions by \textit{Claude Carlet}, ``PN and APN functions'' by \textit{Pascale Charpin}, ``Bent and related functions'' by \textit{Alexander Kholosha} and \textit{Alexander Pott}, ``\(\kappa\)-polynomials and related algebraic objects'' by \textit{Robert Coulter}, ``Planar functions and commutative semifields'' by \textit{Robert Coulter} and ``Dickson polynomials'' by \textit{Qiang Wang} and \textit{Joseph L. Yucas}, and finishes with a discussion of ``Schur's conjecture and exceptional covers'' by \textit{Michael D. Fried}.NEWLINENEWLINENEWLINENEWLINEPart II of the \textit{Handbook} continues in Ch. 10 with ``Sequences over finite fields'' (303--344). This chapter includes material on ``Finite field transforms'' by \textit{Gary McGuire}, ``LFSR sequences and maximal period sequences'' by \textit{Harald Niederreiter}, ``Correlation and autocorrelation of sequences'' by \textit{Tor Helleseth}, ``Linear complexity of sequences and multisequences'' by \textit{Wilfried Meidl} and \textit{Arne Winterhof}, and finally on ``Algebraic dynamical systems over finite fields'' by \textit{Igor Shparlinski}. NEWLINENEWLINENEWLINEAnother very interesting chapter is Ch. 11 ``Algorithms'' (345--404), dealing with various kinds of finite field algorithms. This includes basic finite field ``Computational techniques'' by \textit{Christophe Doche}, ``Univariate polynomial counting and algorithms'' by \textit{Daniel Panario}, ``Algorithms for irreducibility testing and for constructing irreducible polynomials'' by \textit{Mark Giesbrecht}, ``Factorization of univariate polynomials'' by \textit{Joachim von zur Gathen}, ``Factorization of multivariate polynomials'' by \textit{Erich Kaltofen} and \textit{Gregoire Lecerf}, ``Discrete logarithms over finite fields'' by \textit{Andrew Odlyzko}, and ends up with ``Standard models for finite fields'' by \textit{Bart de Smit} and \textit{Hendrik Lenstra}.NEWLINENEWLINE NEWLINEIn Ch. 12 ``Curves over finite fields'' (405--491), are discussed in greater detail. This discussion opens with ``Introduction to function fields and curves'' by \textit{Arnaldo Garcia} and \textit{Henning Stichtenoth}, and includes sections on ``Elliptic curves'' by \textit{Joseph Silverman}, on ``Addition formulas for elliptic curves'' by \textit{Daniel J. Bernstein} and \textit{Tanja Lange}, on ``Hyperelliptic curves'' by \textit{Michael John Jacobson jun.} and \textit{Renate Scheidler}, on ``Rational points on curves'' by \textit{Arnaldo Garcia} and \textit{Henning Stichtenoth}, on ``Towers'' by \textit{Arnaldo Garcia} and \textit{Henning Stichtenoth}, on ``Zeta functions and \(L\)-functions'' by \textit{Lei Fu}, on ``\(p\)-adic estimates of zeta functions and \(L\)-functions'' by \textit{Regis Blache}, and finally on ``Computing the number of rational points and zeta functions'' by \textit{Daqing Wan}.NEWLINENEWLINENEWLINEPart II closes with Ch. 13 ``Miscellaneous theoretical topics'' (493--546), discusses a variety of topics over finite fields. This includes ``Relations between integers and polynomials over finite fields'' by \textit{Gove Effinger}, ``Matrices over finite fields'' by \textit{Dieter Jungnickel}, ``Classical groups over finite fields'' by \textit{Zhe-Xian Wan}, ``Computational linear algebra over finite fields'' by Jean-Guillaume Dumas and \textit{Clément Pernet}, and ends with``Carlitz and Drinfeld modules'' by \textit{David Goss}. NEWLINENEWLINEPart III of the \textit{Handbook}, containing four chapters, discusses various important applications, including mathematical as well as very practical applications of finite fields. Due to the immense number of papers published in these areas, only those are discussed that treat techniques and topics related to finite fields.NEWLINENEWLINE NEWLINEThe first chapter is Ch. 14 ``Combinatorial'' (549--658) including the areas of ``Latin squares'' by \textit{Gary L. Mullen}, ``Lacunary polynomials over finite fields'' by \textit{Simeon Ball} and \textit{Aart Blokhuis}, ``Affine and projective planes'' by \textit{Gary Ebert} and \textit{Leo Storme}, ``Projective spaces'' by \textit{James W. P. Hirschfeld} and \textit{Joseph A. Thas}, ``Block designs'' by \textit{Charles J. Colbourn} and \textit{Jeffrey H. Dinitz}, ``Difference sets'' by Alexander Pott, ``Other combinatorial structures'' by \textit{Jeffrey H. Dinitz} and \textit{Charles J. Colbourn}, ``\((t, m, s)\)-nets and \((t, s)\)-sequences'' by \textit{Harald Niederreiter}, ``Applications and weights of multiples of primitive and other polynomials'' by \textit{Brett Stevens}, and finally ``Ramanujan and expander graphs'' by \textit{M. Ram Murty} and \textit{Sebastian M. Cioaba}.NEWLINENEWLINE NEWLINECh. 15 on ``Algebraic Coding Theory'' (659--739) is another important chapter of the \textit{Handbook}. First it offers a long introductory section on ``Basic coding properties and bounds'' by \textit{Ian Blake} and \textit{W. Cary Huffman}, then follow sections on ``Algebraic-geometry codes'' by \textit{Harald Niederreiter}, ``LDPC and Gallager codes over finite fields'' by \textit{Ian Blake} and \textit{W. Cary Huffman}, ``Turbo codes over finite fields'' by \textit{Oscar Takeshita}, ``Raptor codes'' by \textit{Ian Blake} and \textit{W. Cary Huffman}, and ``Polar codes'' by \textit{Simon Litsyn}.NEWLINENEWLINE NEWLINECh. 16 ``Cryptography'' (741--823), being of equal importance, deals with cryptographic systems over finite fields. In the first section ``Introduction to cryptography'' by \textit{Alfred Menezes} various basic issues dealing with cryptography are discussed. Then follow important topics such as ``Stream and block ciphers'' by \textit{Guang Gong} and \textit{Kishan Chand Gupta}, ``Multivariate cryptographic systems'' by \textit{Jintai Ding}, ``Elliptic curve cryptographic systems'' by \textit{Andreas Enge}, ``Hyperelliptic curve cryptographic systems'' by \textit{Nicolas Thériault}, ``Cryptosystems arising from abelian varieties'' by \textit{Kumar Murty}, and last but not least ``Binary extension field arithmetic for hardware implementations'' by \textit{M. Anwarul Hasan} and \textit{Haining Fan}.NEWLINENEWLINENEWLINEFinally, in Ch. 17 ``Miscellaneous applications'' (825--849) several additional applications of finite fields are discussed, as there are ``Finite fields in biology'' by \textit{Franziska Hinkelmann} and \textit{Reinhard Laubenbacher}, ``Finite fields in quantum information theory'' by \textit{Martin Roetteler} and \textit{Arne Winterhof}, ``Finite fields in engineering'' by \textit{Jonathan Jedwab} and \textit{Kai-Uwe Schmidt}.NEWLINENEWLINE NEWLINEThe authors/editors have collected in their very valuable Bibliography more than 3000 entries which may serve as a quick reference, the more as the relevant pages for each entry are listed. The \textit{Handbook} closes with a useful 23 page Index.NEWLINEFinally one should mention that each section is meant to be self-contained and that no proofs are given, however, references have been given where proofs of important results can be located.NEWLINENEWLINEThough handbooks nowadays are preferably in computerized form, many readers might consider to buy a copy for his own, as it presents such a huge amount of information readily available and masterly presented. NEWLINENEWLINEEditors, contributors and publisher are equally congratulated for providing such a beautiful result not only for the finite field community but also for those from the applied areas, especially cryptographers and coding theorists.
0 references