A Practical Analysis of the Elliptic Curve Factoring Algorithm

DOI10.2307/2152967MaRDI QIDQ3137481zbMATH OpenOpenAlexFDO

Authors 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) Factorization (11Y05) Elliptic curves (14H52) Factorization; primality (11A51)

Recommendations

• Finding Suitable Curves for the Elliptic Curve Method of Factorization
• scientific article; zbMATH DE number 17387
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• scientific article; zbMATH DE number 3959522
• Factoring integers with elliptic curves

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 1494998 (Why is no real title available?)
• scientific article; zbMATH DE number 3801619 (Why is no real title available?)
• Analysis of a simple factorization algorithm
• Factoring integers with elliptic curves
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• The Multiple Polynomial Quadratic Sieve

Cited in

(6)

• Parameter trade-offs for NFS and ECM
• ECM and the Elliott-Halberstam conjecture for quadratic fields
• scientific article; zbMATH DE number 1588471 (Why is no real title available?)
• Factorization of the tenth Fermat number
• Three new factors of Fermat numbers
• ECM using Edwards curves

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

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