Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝
From MaRDI portal
Publication:3160743
DOI10.1090/S0025-5718-2010-02377-4zbMath1231.11145MaRDI QIDQ3160743
Publication date: 8 October 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Related Items (3)
Deterministic root finding over finite fields using Graeffe transforms ⋮ A deterministic version of Pollard’s $p-1$ algorithm ⋮ Bounds on short character sums and \(L\)-functions with characters to a powerful modulus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials modulo special primes
- On the deterministic complexity of factoring polynomials over finite fields
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Factoring polynomials and primitive elements for special primes
- Smoothness and factoring polynomials over finite fields
- Self-witnessing polynomial-time complexity and prime factorization
- Some Ramanujan-Nagell equations with many solutions
- Finding Isomorphisms Between Finite Fields
- A deterministic version of Pollard’s $p-1$ algorithm
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Factoring polynomials over finite fields
- A New Algorithm for Factoring Polynomials Over Finite Fields
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Shifted primes without large prime factors
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- Factoring polynomials over special finite fields
This page was built for publication: Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝
