Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.

DOI10.1016/S1071-5797(02)00005-9zbMath1090.11072MaRDI QIDQ1867478

Melsik K. Kyureghyan

Publication date: 2 April 2003

Published in: Finite Fields and their Applications (Search for Journal in Brave)

zbMATH Keywords

Galois fieldsIrreducible polynomialsRecurrent method

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Related Items (10)

A recurrent construction of irreducible polynomials of fixed degree over finite fields ⋮ Irreducible compositions of polynomials over finite fields of even characteristic ⋮ Recursive constructions of irreducible polynomials over finite fields ⋮ Irreducible compositions of polynomials over finite fields ⋮ Construction of primitive polynomials over finite fields ⋮ FACTORIZATION OF SOME COMPOSITE POLYNOMIALS OVER FINITE FIELDS ⋮ Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II ⋮ Modular composition via factorization ⋮ Explicit theorems on generator polynomials ⋮ Sequences of irreducible polynomials without prescribed coefficients over odd prime fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic algorithms in GF(q)
• The explicit construction of irreducible polynomials over finite fields
• Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
• On the construction of irreducible self-reciprocal polynomials over finite fields
• Factorization of Multivariate Polynomials Over Finite Fields
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• On irreducible polynomials of certain types in finite fields
• Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato

This page was built for publication: Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.