Factoring Large Integers

DOI10.2307/2005940zbMath0285.10006OpenAlexW4231306509WikidataQ59795642 ScholiaQ59795642MaRDI QIDQ4771013

R. Sherman Lehman

Publication date: 1974

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

Mathematics Subject Classification ID

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

Related Items (13)

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

Cites Work

• Unnamed Item

This page was built for publication: Factoring Large Integers