Factoring Large Integers

DOI10.2307/2005940MaRDI QIDQ4771013zbMATH OpenOpenAlexWikidataFDO

Authors R. Sherman Lehman

Publication date 1974

Full work available at URL https://doi.org/10.2307/2005940

Mathematics Subject Classification ID

Primes (11A41) Software, source code, etc. for problems pertaining to number theory (11-04)

Cited in

(14)

• Asymptotically Fast Factorization of Integers
• Cryptanalysis of RSA Using the Ratio of the Primes
• Explicit methods in number theory. Abstracts from the workshop held July 18--24, 2021 (hybrid meeting)
• An exponent one-fifth algorithm for deterministic integer factorisation
• Cryptanalysis of short secret exponents modulo RSA primes.
• A time-space tradeoff for Lehman's deterministic integer factorization method
• Smooth factors of integers and elliptic curve based factoring with an oracle
• A deterministic algorithm for integer factorization
• A generalization of Lehman's method
• Proof the Skewes' number is not an integer using lattice points and tangent line
• Integer factorization as subset-sum problem
• An overview of factoring
• A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
• Deterministic factoring with oracles

This page was built for publication: Factoring Large Integers

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