A Monte Carlo Factoring Algorithm With Linear Storage

DOI10.2307/2007414MaRDI QIDQ3347945zbMATH OpenOpenAlexWikidataFDO

Authors H. W. jun. Lenstra, Claus Peter Schnorr

Publication date 1984

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

zbMATH Keywords

ambiguous formsclass groupeffectivenessfactorizationrunning timeShanks algorithm

Mathematics Subject Classification ID

Primes (11A41) Class numbers of quadratic and Hermitian forms (11E41) Quadratic extensions (11R11) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The Expectation of Success Using a Monte Carlo Factoring Method--Some Statistics on Quadratic Class Numbers
• A Rigorous Time Bound for Factoring Integers
• scientific article; zbMATH DE number 475432
• A monte carlo method for factorization
• scientific article; zbMATH DE number 475434

Cited in

(24)

• On the distribution in short intervals of integers having no large prime factor
• On the oracle complexity of factoring integers
• Speeding up elliptic curve discrete logarithm computations with point halving
• Solving discrete logarithm problems faster with the aid of pre-computation
• On random walks for Pollard's rho method
• A generic approach to searching for Jacobians
• The Factorization of the Ninth Fermat Number
• Explicit Bounds for Primality Testing and Related Problems
• Speeding Up the Pollard Rho Method on Prime Fields
• Factoring with Cyclotomic Polynomials
• A Rigorous Time Bound for Factoring Integers
• A monte carlo method for factorization
• An efficient collision detection method for computing discrete logarithms with Pollard's rho
• A space efficient algorithm for group structure computation
• Accelerating Pollard's rho algorithm on finite fields
• Asymptotic semismoothness probabilities
• An overview of factoring
• scientific article; zbMATH DE number 5192057 (Why is no real title available?)
• Factoring: algorithms, computations, and computers
• Combining Montgomery multiplication with tag tracing for the Pollard rho algorithm in prime order fields
• CryptAttackTester: high-assurance attack analysis
• Fast square-free decomposition of integers using class groups
• Some uses of microcomputers in number theory research
• New designing of cryptosystems based on quadratic fields

This page was built for publication: A Monte Carlo Factoring Algorithm With Linear Storage

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