On the distribution of running times of certain integer factoring algorithms

DOI10.1016/0196-6774(89)90004-7zbMath0689.68055OpenAlexW2065723910MaRDI QIDQ3031925

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

zbMATH Keywords

lower boundinteger factorization problemrandom polynomial time

Mathematics Subject Classification ID

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

Related Items (2)

Sieve algorithms for perfect power testing ⋮ On the largest prime factor of an integer

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