Revision as of 08:05, 23 December 2024 edit Citation bot (talk \| contribs) Bots 5,871,615 edits Added pages. \| Use this bot. Report bugs. \| Suggested by Dominic3203 \| Category:Integer factorization algorithms \| #UCB_Category 11/26 ← Previous edit		Revision as of 00:55, 25 December 2024 edit undo 37.198.21.82 (talk) Correct spelling of Paul ZImmermann's name. Next edit →
Line 117: ==GMP-ECM and EECM-MPFQ== The use of Twisted Edwards elliptic curves, as well as other techniques were used by Bernstein et al<ref name=Bernstein2008 /> to provide an optimized implementation of ECM. Its only drawback is that it works on smaller composite numbers than the more general purpose implementation, GMP-ECM of ~~Zimmerman~~Zimmermann. ==Hyperelliptic-curve method (HECM)==

Lenstra elliptic-curve factorization: Difference between revisions