Smoothness and factoring polynomials over finite fields

DOI10.1016/0020-0190(91)90212-ZzbMath0744.11068MaRDI QIDQ1178194

Victor Shoup

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

finite fieldsextended Riemann hypothesisfactorization of polynomialsdeterministic algorithm

Mathematics Subject Classification ID

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

Related Items (11)

Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 ⋮ Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\) ⋮ Deterministic root finding over finite fields using Graeffe transforms ⋮ Univariate polynomial factorization over finite fields ⋮ On Bivariate Polynomial Factorization over Finite Fields ⋮ Constructing nonresidues in finite fields and the extended Riemann hypothesis ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Factoring polynomials over finite fields: A survey ⋮ Searching for Primitive Roots in Finite Fields ⋮ Unnamed Item ⋮ A Generalised Successive Resultants Algorithm

Cites Work

• Factoring polynomials modulo special primes
• On the deterministic complexity of factoring polynomials over finite fields
• Factoring polynomials and primitive elements for special primes
• On fast multiplication of polynomials over arbitrary algebras
• Some results on computational complexity
• The least quadratic non residue
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• The average of the least primitive root
• Factoring Polynomials Over Large Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Smoothness and factoring polynomials over finite fields