Factoring polynomials over special finite fields

DOI10.1006/ffta.2000.0306zbMath0985.11060OpenAlexW2000103501MaRDI QIDQ5927536

Hendrik W. jun. Lenstra, Joachim von zur Gathen, Eric Bach

Publication date: 19 May 2002

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

Full work available at URL: https://doi.org/10.1006/ffta.2000.0306

zbMATH Keywords

algorithmsfactorization of polynomials over finite fieldsfinite fieldsGauss sums

Mathematics Subject Classification ID

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

Related Items (5)

Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 ⋮ Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations ⋮ On the deterministic complexity of factoring polynomials ⋮ Deterministic polynomial factoring and association schemes ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials modulo special primes
• Factoring polynomials and primitive elements for special primes
• Generalized riemann hypothesis and factoring polynomials over finite fields
• Finding Isomorphisms Between Finite Fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Factoring with Cyclotomic Polynomials
• Algorithms in Algebraic Number Theory
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• Counting the Integers Factorable via Cyclotomic Methods
• Factoring Polynomials Over Large Finite Fields
• The orders of the linear groups

This page was built for publication: Factoring polynomials over special finite fields