The explicit construction of irreducible polynomials over finite fields
From MaRDI portal
Publication:1200310
DOI10.1007/BF00124895zbMath0768.11048OpenAlexW2062604976MaRDI QIDQ1200310
Publication date: 16 January 1993
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00124895
finite fieldirreducible polynomialconstruction of iterated presentations infinite algebraic extensions
Related Items
A recurrent construction of irreducible polynomials of fixed degree over finite fields ⋮ Generalized reciprocals, factors of Dickson polynomials and generalized cyclotomic polynomials over finite fields ⋮ Explicit N-polynomials of \(2\)-power degree over finite fields. I ⋮ Construction of irreducible polynomials using cubic transformation ⋮ Iterated constructions of irreducible polynomials over finite fields with linearly independent roots ⋮ Sequences of irreducible polynomials over odd prime fields via elliptic curve endomorphisms ⋮ High order elements in finite fields arising from recursive towers ⋮ On the iterations of certain maps \(X \mapsto K \cdot(X + X^{- 1})\) over finite fields of odd characteristic ⋮ Constructing irreducible polynomials recursively with a reverse composition method ⋮ Self-reciprocal irreducible polynomials with prescribed coefficients ⋮ A new direction on constructing irreducible polynomials over finite fields ⋮ On the reducibility of some composite polynomials over finite fields ⋮ On the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials ⋮ Irreducible compositions of polynomials over finite fields ⋮ Factorization of a class of polynomials over finite fields ⋮ Enumeration of a special class of irreducible polynomials in characteristic 2 ⋮ Recursive constructions of N-polynomials over \(\text{GF}(2^s)\) ⋮ On the construction of irreducible polynomials over finite fields via odd prime degree endomorphisms of elliptic curves ⋮ ELEMENTS OF HIGH ORDER ON FINITE FIELDS FROM ELLIPTIC CURVES ⋮ Factors of Dickson polynomials over finite fields. ⋮ Iterated constructions of completely normal polynomials ⋮ On the action of \(\text{GL}_2(\mathbb F_q)\) on irreducible polynomials over \(\mathbb F_q\) ⋮ On different families of invariant irreducible polynomials over \(\mathbb F_2\) ⋮ Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II ⋮ On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan ⋮ Completely normal elements in iterated quadratic extensions of finite fields ⋮ A correspondence of certain irreducible polynomials over finite fields ⋮ Explicit theorems on generator polynomials ⋮ Sequences of irreducible polynomials without prescribed coefficients over odd prime fields ⋮ Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\) ⋮ Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics. ⋮ Finite field towers: Iterated presentation and complexity of arithmetic.
Cites Work
- Unnamed Item
- Unnamed Item
- An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field
- On the construction of irreducible self-reciprocal polynomials over finite fields
- Infinite Algebraic Extensions of Finite Fields
- Some theorems on irreducible reciprocal polynomials over a finite field.
- On irreducible polynomials of certain types in finite fields
