A Monte Carlo Factoring Algorithm With Linear Storage
From MaRDI portal
Publication:3347945
DOI10.2307/2007414zbMath0559.10004OpenAlexW4214814689WikidataQ56388133 ScholiaQ56388133MaRDI QIDQ3347945
Hendrik W. jun. Lenstra, Claus Peter Schnorr
Publication date: 1984
Full work available at URL: https://doi.org/10.2307/2007414
Analysis of algorithms and problem complexity (68Q25) Quadratic extensions (11R11) Class numbers of quadratic and Hermitian forms (11E41) Primes (11A41)
Related Items (20)
On the distribution in short intervals of integers having no large prime factor ⋮ On the oracle complexity of factoring integers ⋮ An efficient collision detection method for computing discrete logarithms with Pollard's rho ⋮ Combining Montgomery multiplication with tag tracing for the Pollard rho algorithm in prime order fields ⋮ Speeding up elliptic curve discrete logarithm computations with point halving ⋮ Accelerating Pollard's rho algorithm on finite fields ⋮ Some uses of microcomputers in number theory research ⋮ On random walks for Pollard's rho method ⋮ The Factorization of the Ninth Fermat Number ⋮ New designing of cryptosystems based on quadratic fields ⋮ Factoring: algorithms, computations, and computers ⋮ Speeding Up the Pollard Rho Method on Prime Fields ⋮ A generic approach to searching for Jacobians ⋮ A Rigorous Time Bound for Factoring Integers ⋮ Explicit Bounds for Primality Testing and Related Problems ⋮ Asymptotic semismoothness probabilities ⋮ Solving discrete logarithm problems faster with the aid of pre-computation ⋮ A space efficient algorithm for group structure computation ⋮ Factoring with Cyclotomic Polynomials ⋮ An Overview of Factoring
This page was built for publication: A Monte Carlo Factoring Algorithm With Linear Storage
