An FFT Extension to the P - 1 Factoring Algorithm

DOI10.2307/2008514MaRDI QIDQ3497176zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

factoring algorithmFast Fourier Transform techniques

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Polynomials over finite fields (11T06) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Improved Stage 2 to P ± 1 Factoring Algorithms
• scientific article; zbMATH DE number 475434
• The Multiple Polynomial Quadratic Sieve
• scientific article; zbMATH DE number 3991578

Cited in

(9)

• Extendible look-up table of twiddle factors and radix-8 based fast Fourier transform
• The Factorization of the Ninth Fermat Number
• Modular exponentiation via the explicit Chinese remainder theorem
• A Generalized Prime Factor FFT Algorithm for any N = 2p 3q 5r
• Asymptotic semismoothness probabilities
• Improved Stage 2 to P ± 1 Factoring Algorithms
• FFT Extension for Algebraic-Group Factorization Algorithms
• Reducing the number of qubits in quantum factoring
• Optimal strong primes

This page was built for publication: An FFT Extension to the P - 1 Factoring Algorithm

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