Jump to content

Lenstra elliptic-curve factorization

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 18.252.2.32 (talk) at 23:31, 3 December 2002. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Lenstra Elliptic Curve Factorization method was the best algorithm for integer factorization until General Number Field Sieve was developed.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Lenstra_elliptic-curve_factorization&oldid=458732"