Refined analysis and improvements on some factoring algorithms

DOI10.1016/0196-6774(82)90012-8zbMath0485.10004OpenAlexW1970515545WikidataQ56049894 ScholiaQ56049894MaRDI QIDQ3944659

Claus Peter Schnorr

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0196-6774(82)90012-8

zbMATH Keywords

quadratic formsfactorization of integersRSA public key cryptosystemMiller's methodfactoring large integersMorrison-Brillhart-algorithmShanks' method

Mathematics Subject Classification ID

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

Related Items

On the distribution in short intervals of integers having no large prime factor ⋮ Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel ⋮ Václav Šimerka: quadratic forms and factorization ⋮ Modifications to the number field sieve