A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields

DOI10.1007/978-3-642-23568-9_1zbMath1241.11133OpenAlexW153841682MaRDI QIDQ3090887

Sergey Abrahamyan, Melsik K. Kyureghyan

Publication date: 2 September 2011

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23568-9_1

zbMATH Keywords

finite fieldpolynomial compositionrecurrent method

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (3)

Recursive construction of normal polynomials over finite fields ⋮ Recursive constructions of irreducible polynomials over finite fields ⋮ Recursive constructions of k-normal polynomials using some rational transformations over finite fields

This page was built for publication: A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields