scientific article; zbMATH DE number 437575

MaRDI QIDQ3140455zbMATH OpenFDO

Authors Victor Shoup

Publication date 9 November 1994

zbMATH Keywords

algorithmalgorithms for testing irreducibilitycomputing minimal polynomialsfactoring cyclotomic polynomialsfinite fieldirreducible polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Fast construction of irreducible polynomials over finite fields
• Constructing irreducible polynomials over finite fields
• Fast construction of irreducible polynomials over finite fields
• Finding irreducible and primitive polynomials
• On arithmetical algorithms over finite fields

Cited in

(11)

• Arithmetic of finite fields
• Computing Frobenius maps and factoring polynomials
• Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• scientific article; zbMATH DE number 1008373 (Why is no real title available?)
• Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
• Computing isomorphisms and embeddings of finite fields
• scientific article; zbMATH DE number 3997938 (Why is no real title available?)
• An algorithm for finding the minimum degree of a polynomial over a finite field for a function over a vector space depending on the choice of an irreducible polynomial
• Fast construction of irreducible polynomials over finite fields
• Fast construction of irreducible polynomials over finite fields

This page was built for publication:

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