A Practical Analysis of the Elliptic Curve Factoring Algorithm

DOI10.2307/2152967zbMATH Open0784.11005OpenAlexW4243292648MaRDI QIDQ3137481FDOQ3137481

Authors: Robert D. Silverman, Samuel S. jun. Wagstaff 

Publication date: 1 November 1993

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

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

zbMATH Keywords

elliptic curve factorization

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• ECM using Edwards curves
• Three new factors of Fermat numbers
• ECM and the Elliott-Halberstam conjecture for quadratic fields
• Title not available (Why is that?)
• Factorization of the tenth Fermat number
• Parameter trade-offs for NFS and ECM

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)