Completely normal elements in iterated quadratic extensions of finite fields
Given a finite field \(F_q\) and an integer \(n \geq 1\), an element \(\alpha\) of \(F_{q^n}\) is called normal over \(F_q\) if its \(F_q\)-conjugates form an \(F_q\)-vector space basis of \(F_{q^n}\). The element \(\alpha\) is called \textit{completely normal over \(F_q\)}, if, simultaneously, for each divisor \(d\) of \(n\), the \(F_{q^d}\)-conjugates of \(\alpha\) constitute an \(F_{q^d}\)-vector space basis of \(F_{q^n}\). For certain ground fields \(F_q\) and certain degrees \(n\) the author provides explicit constructions of (sequences of) irreducible polynomials whose roots are completely normal elements. More precisely, the results are as follows: For \(q \equiv 1\) mod \(4\) and \(n\) a power of \(2\) it is shown that \textit{S. D. Cohen}'s recursive construction of irreducible polynomials of degree \(n\) over \(F_q\) [Des. Codes Cryptography 2, 169-174 (1992; Zbl 0768.11048)] yields polynomials whose roots are completely normal over \(F_q\). The normality of these elements was previously proved by \textit{H. Meyn} [Des. Codes Cryptography 6, 107-116 (1995; Zbl 0834.11053)]. For \(q \equiv 3\) mod \(4\) and \(n\) a power of \(2\) it is shown that McNay's recursive construction of irreducible polynomials of degree \(n\) over \(F_q\) [\textit{G. McNay}, ``Topics in Finite Fields, Ph.D. thesis, University of Glasgow (1995)] yields polynomials whose roots are completely normal over \(F_q\). The author also discusses a generalization of the polynomial transformations of Cohen and McNay in order to obtain sequences of irreducible polynomials of degree a power of an odd prime \(r\) for ground fields \(F_q\) where \(q \equiv 1\bmod 2r\). Again the roots of these polynomials are completely normal over \(F_q\).
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Construction of irreducible polynomials through rational transformations
- scientific article; zbMATH DE number 4075226
- scientific article; zbMATH DE number 3955054
- On the irreducibility of some composite polynomials
- Construction of Irreducible Polynomials over Finite Fields
- A recurrent construction of irreducible polynomials of fixed degree over finite fields
- scientific article; zbMATH DE number 4146067
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Eine Verschärfung des Satzes von der Normalbasis. (An improvement of the normal basis theorem)
- Explicit N-polynomials of 2-power degree over finite fields. I
- Specific irreducible polynomials with linearly independent roots over finite fields
- The explicit construction of irreducible polynomials over finite fields
- Explicit N-polynomials of 2-power degree over finite fields. I
- Irreducible compositions of polynomials over finite fields of even characteristic
- Iterated constructions of completely normal polynomials
- Generalized reciprocals, factors of Dickson polynomials and generalized cyclotomic polynomials over finite fields
- Recurrent methods for constructing irreducible polynomials over F_q of odd characteristics. II
- Explicit theorems on generator polynomials
- High order elements in finite fields arising from recursive towers
- Completely normal elements in some finite abelian extensions
- scientific article; zbMATH DE number 1047542 (Why is no real title available?)
- scientific article; zbMATH DE number 1047543 (Why is no real title available?)
- On elements of normal depth-2 in quartic extensions of Fp
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Irreducible compositions of polynomials over finite fields
- The R-transform as power map and its generalizations to higher degree
- Specific irreducible polynomials with linearly independent roots over finite fields
- Dickson polynomials, completely normal polynomials and the cyclic module structure of specific extensions of finite fields
- Rational transformations over finite fields that are never irreducible
- Recursive constructions of N-polynomials over \(\text{GF}(2^s)\)
- Factors of Dickson polynomials over finite fields.
This page was built for publication: Completely normal elements in iterated quadratic extensions of finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266428)
