On factoring large numbers

DOI10.1090/S0002-9904-1931-05271-XzbMATH Open0003.10202OpenAlexW2026499134WikidataQ22305547 ScholiaQ22305547MaRDI QIDQ4479544FDOQ4479544

Authors: D. H. Lehmer, R. E. Powers 

Publication date: 1931

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1931-05271-x

zbMATH Keywords

algebra, number theory

Cited In (7)

• Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
• Factoring Integers with Large-Prime Variations of the Quadratic Sieve
• Factoring RSA moduli with primes sharing bits in the middle
• Sufficient conditions for factoring a class of large integers
• Reading Gauss in the computer age: On the U.S. Reception of Gauss's number theoretical work (1938-1989)
• Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel
• Factoring multi power RSA moduli with a class of secret exponents

This page was built for publication: On factoring large numbers

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