An FFT Extension to the P - 1 Factoring Algorithm
From MaRDI portal
Publication:3497176
DOI10.2307/2008514zbMath0712.11075OpenAlexW4255669208MaRDI QIDQ3497176
Robert D. Silverman, Peter L. Montgomery
Publication date: 1990
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2008514
Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50) Polynomials over finite fields (11T06) Congruences; primitive roots; residue systems (11A07) Factorization (11Y05)
Related Items
Optimal strong primes ⋮ Improved Stage 2 to P ± 1 Factoring Algorithms ⋮ The Factorization of the Ninth Fermat Number ⋮ Asymptotic semismoothness probabilities ⋮ Modular exponentiation via the explicit Chinese remainder theorem
