Constructing irreducible polynomials recursively with a reverse composition method

DOI10.1007/s10623-023-01271-zarXiv2301.09373MaRDI QIDQ6130613

Gohar M. Kyureghyan, Anna-Maurin Graner

Publication date: 3 April 2024

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.09373

zbMATH Keywords

characteristic polynomialrecursive constructionirreducible polynomialmultiplicative ordercomposition method\(k\)-th power

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Cites Work

• Unnamed Item
• Sequences of binary irreducible polynomials
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• Irreducible compositions of polynomials over finite fields
• The explicit construction of irreducible polynomials over finite fields
• Explicit N-polynomials of \(2\)-power degree over finite fields. I
• A recurrent construction of irreducible polynomials of fixed degree over finite fields
• Construction of irreducible polynomials through rational transformations
• Existence and properties of \(k\)-normal elements over finite fields
• Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II
• Constructing normal bases in finite fields
• CONSTRUCTION OF POLYNOMIALS IRREDUCIBLE OVER A FINITE FIELD WITH LINEARLY INDEPENDENT ROOTS
• Generation of Irreducible Polynomials Over a Finite Field
• On irreducible polynomials of certain types in finite fields

This page was built for publication: Constructing irreducible polynomials recursively with a reverse composition method