On the distribution of running times of certain integer factoring algorithms

DOI10.1016/0196-6774(89)90004-7zbMATH Open0689.68055OpenAlexW2065723910MaRDI QIDQ3031925FDOQ3031925

Authors: Kevin S. McCurley, James Lee Hafner 

Publication date: 1989

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(89)90004-7

Recommendations

• A Rigorous Time Bound for Factoring Integers
• The distribution of solutions to \(XN=N \pmod a\) with an application to factoring integers
• Asymptotically Fast Factorization of Integers
• scientific article; zbMATH DE number 475434
• Running Time Predictions for Factoring Algorithms

zbMATH Keywords

lower boundinteger factorization problemrandom polynomial time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Primes (11A41)

Cited In (6)

• Analysis of some elementary algorithms for prime factorization
• Sieve algorithms for perfect power testing
• On the Complexity of the Montes Ideal Factorization Algorithm
• On the largest prime factor of an integer
• The distribution of solutions to \(XN=N \pmod a\) with an application to factoring integers
• Running Time Predictions for Factoring Algorithms

This page was built for publication: On the distribution of running times of certain integer factoring algorithms

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