Handbook of finite fields
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to number theory (11-00) Curves over finite and local fields (11G20) Finite fields and commutative rings (number-theoretic aspects) (11Txx) Finite fields (field-theoretic aspects) (12E20) Finite ground fields in algebraic geometry (14G15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
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.
- scientific article; zbMATH DE number 830356
- Finite fields: theory and applications
- Finite fields and applications
- scientific article; zbMATH DE number 204179
- Arithmetic of finite fields
- scientific article; zbMATH DE number 51381
- scientific article; zbMATH DE number 3861057
- scientific article; zbMATH DE number 922674
- scientific article; zbMATH DE number 19618
- Smoothness test for polynomials defined over small characteristic finite fields
- On the existence of primitive completely normal bases of finite fields
- Some classes of permutation polynomials over finite fields with odd characteristic
- Six new classes of permutation trinomials over \(\mathbb{F}_{3^{3k}}\)
- New classes of complete permutation polynomials
- On evaluation codes coming from a tower of function fields
- On a conjecture about a class of permutation trinomials
- On \(k\)-normal elements over finite fields
- General constructions of permutation polynomials of the form \((x^{2^m} + x + \delta)^{i(2^m - 1) + 1} + x\) over \(\mathbb{F}_{2^{2 m}}\)
- Permutation polynomials of the type \(x^rg(x^{s})\) over \({\mathbb {F}}_{q^{2n}}\)
- Artin-Schreier extensions of normal bases
- A new class of permutation trinomials constructed from Niho exponents
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
- Covering arrays from m-sequences and character sums
- Quantum one-way permutation over the finite field of two elements
- On permutation trinomials of type \(x^{2 p^s + r} + x^{p^s + r} + \lambda x^r\)
- Permutation polynomials over finite rings
- Explicit evaluation of Walsh transforms of a class of Gold type functions
- Nilpotent linearized polynomials over finite fields and applications
- New results on permutation polynomials of the form \((x^{{p}^{m}} - x + \delta)^s + x^{p^m} + x\) over \(\mathbb F_{p^{2m}}\)
- The graph structure of Chebyshev polynomials over finite fields and applications
- Upper bounds and constructions of complete asynchronous channel hopping systems
- On a conjecture of Fernando, Hou and Lappano concerning permutation polynomials over finite fields
- p-adic valuation of exponential sums associated to trinomials and some consequences
- Polyadic integer numbers and finite (m,n)-fields
- Hadamard matrices and the spectrum of quadratic symmetric polynomials over finite fields
- Permutation polynomials, fractional polynomials, and algebraic curves
- Permutation polynomials \((x^{p^m} - x + \delta)^{s_1} +(x^{p^m} - x + \delta)^{s_2} + x\) over \(\mathbb{F}_{p^n}\)
- Trace of products in finite fields
- On the construction of irreducible polynomials over finite fields via odd prime degree endomorphisms of elliptic curves
- Prescribing digits in finite fields
- A constructive approach to the finite wavelet frames over prime fields
- On the sum of digits of special sequences in finite fields
- Irreducible factorization of translates of reversed Dickson polynomials over finite fields
- Constructions of complete permutation polynomials
- A fast parallel sparse polynomial GCD algorithm
- Estimates on the number of \(\mathbb{F}_q\)-rational solutions of variants of diagonal equations over finite fields
- On finite field arithmetic in characteristic 2
- Two classes of permutation trinomials with Niho exponents over finite fields with even characteristic
- Perfect linear complexity profile and apwenian sequences
- On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm
- A natural graph of finite fields distinguishing between models
- A new criterion on \(k\)-normal elements over finite fields
- Expansive automata networks
- Permutation polynomials of the form \(x + \gamma \mathrm{Tr}_q^{q^n}(h(x))\)
- Almost perfect nonlinear trinomials and hexanomials
- Dembowski-Ostrom polynomials and reversed Dickson polynomials
- Permutation polynomials and factorization
- Permutations polynomials of the form \(G(X)^k - L(X)\) and curves over finite fields
- On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\)
- A reduction formula for Waring numbers through generalized Paley graphs
- Polynomial modular product verification and its implications
- Characterizations and constructions of \(n\)-to-1 mappings over finite fields
- Dwork hypersurfaces of degree six and Greene's hypergeometric function
- Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
- On the number of solutions of systems of certain diagonal equations over finite fields
- Analysis of periodic linear systems over finite fields with and without Floquet transform
- A new lower bound on the family complexity of Legendre sequences
- A new family of algebraically defined graphs with small automorphism group
- Counting irreducible polynomials with prescribed coefficients over a finite field
- On the number of irreducible polynomials of special kinds in finite fields
- Normality of the Thue-Morse function for finite fields along polynomial values
- The existence of \(\mathbb{F}_q\)-primitive points on curves using freeness
- Binary sequences derived from monomial permutation polynomials over \(\mathrm{GF}(2^p)\)
- Classification of permutation polynomials of the form \(x^3g(x^{q-1})\) of \(\mathbb{F}_{q^2}\) where \(g(x)=x^3+bx+c\) and \(b, c \in\mathbb{F}_q^*\)
- Pseudorandom sequences derived from automatic sequences
- Tangent-Chebyshev maps over finite fields: new properties and functional graphs
- Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes
- Unicyclic strong permutations
- Frobenius linear translators giving rise to new infinite classes of permutations and bent functions
- Full classification of permutation rational functions and complete rational functions of degree three over finite fields
- Permutations from an arithmetic setting
- On a generalization of planar functions
- Solving \(x+x^{2^l}+\ldots +x^{2^{ml}}=a\) over \(\mathbb{F}_{2^n} \)
- Rédei permutations with cycles of the same length
- The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions
- Permutation polynomials with Carlitz rank 2
- Computing the multilinear factors of lacunary polynomials without heights
- Finding linearly generated subsequences
- Permutation polynomials of the form \(x^d+L(x^{s})\) over \(\mathbb{F}_{q^3}\)
- Binomial permutations over finite fields with even characteristic
- Sharpening of the explicit lower bounds for the order of elements in finite field extensions based on cyclotomic polynomials
- A Swan-like note for a family of binary pentanomials
- Permutation trinomials over \(\mathbb{F}_{q^3} \)
- Irreducible factors of a class of permutation polynomials
- Multidimensional linear complexity analysis of periodic arrays
- On a theorem of Morlaye and Joly and its generalization
- On \(q\)-ary plateaued functions over \(\mathbb{F}_q\) and their explicit characterizations
- Almost-nonsingular entry pattern matrices
- A note on good permutation codes from Reed-Solomon codes
- Further results on permutation trinomials with Niho exponents
- A revisit to a class of permutation quadrinomials
- A note regarding permutation binomials over \(\mathbb{F}_{q^2}\)
- On the computation of rational points of a hypersurface over a finite field
- Further results on permutation trinomials over finite fields with even characteristic
- A generalization of APN functions for odd characteristic
- Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields
- Finite flag-transitive affine planes with a solvable automorphism group
- Invariants of trace forms in odd characteristic and authentication codes
- Near-complete external difference families
This page was built for publication: Handbook of finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841743)
