On factoring large numbers
From MaRDI portal
Publication:4479544
DOI10.1090/S0002-9904-1931-05271-XzbMath0003.10202OpenAlexW2026499134WikidataQ22305547 ScholiaQ22305547MaRDI QIDQ4479544
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
Related Items
Factoring RSA moduli with primes sharing bits in the middle, Factoring multi power RSA moduli with a class of secret exponents, Factoring Integers with Large-Prime Variations of the Quadratic Sieve, Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel, Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms, 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)