Content deleted Content added
m Task 18 (cosmetic): eval 15 templates: del empty params (1×); hyphenate params (1×); |
m added technical flag- this is very advanced math... |
||
Line 1:
{{technical|date=December 2020}}
The '''Lenstra elliptic-curve factorization''' or the '''elliptic-curve factorization method''' ('''ECM''') is a fast, sub-[[exponential running time]], algorithm for [[integer factorization]], which employs [[elliptic curve]]s. For [[general-purpose computer|general-purpose]] factoring, ECM is the third-fastest known factoring method. The second-fastest is the [[quadratic sieve|multiple polynomial quadratic sieve]], and the fastest is the [[general number field sieve]]. The Lenstra elliptic-curve factorization is named after [[Hendrik Lenstra]].
| |||