Constructing irreducible polynomials over finite fields

DOI10.1090/S0025-5718-2011-02567-6MaRDI QIDQ2894527zbMATH OpenOpenAlexFDO

Authors San Ling, Enver Ozdemir, Chaoping Xing

Publication date 29 June 2012

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0025-5718-2011-02567-6

zbMATH Keywords

finite fieldsHilbert class polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Construction of Irreducible Polynomials over Finite Fields
• Construction of irreducible polynomials over finite fields
• scientific article; zbMATH DE number 3897066
• The explicit construction of irreducible polynomials over finite fields
• scientific article; zbMATH DE number 4150334
• Recursive constructions of irreducible polynomials over finite fields
• scientific article; zbMATH DE number 3997938
• Irreducible polynomials over a finite field
• scientific article; zbMATH DE number 4146067
• Constructions of irreducible polynomials over finite fields with even characteristic

Cites work

• A Rigorous Subexponential Algorithm For Computation of Class Groups
• Abelian varieties over finite fields
• Class numbers of imaginary quadratic fields
• Elliptic curves. Number theory and cryptography
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Probabilistic Algorithms in Finite Fields
• Subquadratic-time factoring of polynomials over finite fields
• The complexity of class polynomial computation via floating point approximations

Cited in

(9)

• Sequences of irreducible polynomials over odd prime fields via elliptic curve endomorphisms
• New algorithms for generating Conway polynomials over finite fields
• A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
• scientific article; zbMATH DE number 437575 (Why is no real title available?)
• scientific article; zbMATH DE number 1305433 (Why is no real title available?)
• GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS
• Construction of primitive polynomials over finite fields
• Fast construction of irreducible polynomials over finite fields
• Iterative constructions of irreducible polynomials from isogenies

This page was built for publication: Constructing irreducible polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894527)