A Practical Analysis of the Elliptic Curve Factoring Algorithm

DOI10.2307/2152967zbMath0784.11005OpenAlexW4243292648MaRDI QIDQ3137481

Robert D. Silverman, Samuel S. jun. Wagstaff

Publication date: 1 November 1993

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

zbMATH Keywords

elliptic curve factorization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Elliptic curves (14H52) Factorization; primality (11A51) Factorization (11Y05)

Related Items (3)

ECM using Edwards curves ⋮ Three new factors of Fermat numbers ⋮ Factorization of the tenth Fermat number

Cites Work

• Factoring integers with elliptic curves
• Analysis of a simple factorization algorithm
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• The Multiple Polynomial Quadratic Sieve
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Practical Analysis of the Elliptic Curve Factoring Algorithm