The Lenstra elliptic curve factorization or the elliptic curve factorization method (ECM) is a fast, subexponential running time algorithm for integer factorization which employs elliptic curves. For general purpose factoring, ECM is the thirdfastest known factoring method. The second fastest is the multiple polynomial quadratic sieve and the fastest is the general number field sieve. The Lenstra elliptic curve factorization is named after Hendrik Lenstra.
Practically speaking, ECM is considered a special purpose factoring algorithm as it is most suitable for finding small factors. Currently^{[update]}, it is still the best algorithm for divisors not greatly exceeding 20 to 25 digits (64 to 83 bits or so), as its running time is dominated by the size of the smallest factor p rather than by the size of the number n to be factored. Frequently, ECM is used to remove small factors from a very large integer with many factors; if the remaining integer is still composite, then it has only large factors and is factored using general purpose techniques. The largest factor found using ECM so far has 83 digits and was discovered on 7 September 2013 by R. Propper.^{[1]} Increasing the number of curves tested improves the chances of finding a factor, but they are not linear with the increase in the number of digits.
Contents
Lenstra's elliptic curve factorization[edit]
The Lenstra elliptic curve factorization method to find a factor of the given natural number n works as follows:
 Pick a random elliptic curve over , with equation of the form together with a nontrivial point on it.
 This can be done by first picking random , and then calculating .
 'Addition' of P and Q as points in general defines a group operation P ⊕ Q on the curve whose product can be computed from formulas given in the article on elliptic curves.
 Using this assumption, we can form repeated multiples of a point P: kP = P ⊕ ... ⊕ P (k times). The addition formulas involve the taking the modular slope of a chord joining P and Q, and thus division between residue classes modulo n, performed using the extended Euclidean algorithm. In particular, division by some v (mod n) includes calculation of the gcd(v, n).
 If the slope is of the form u/v with gcd(u, n) = 1, then v = 0 (mod n) means that the result of the ⊕addition will be ∞, the point 'at infinity' corresponding to the intersection of the 'vertical' line joining P (x, y), P'(x, −y) and the curve. However, if gcd(v, n) is neither 1 nor n, then the ⊕addition will not produce a meaningful point on the curve, which shows that our elliptic curve is not a group (mod n), but, more importantly for now, gcd(v, n) is a nontrivial factor of n.
 Compute eP on the elliptic curve (mod n), where e is product of many small numbers: say, a product of small primes raised to small powers, as in the p − 1 algorithm, or the factorial for some not too large B. This can be done efficiently, one small factor at a time. Say, to get B!P, first compute 2P, then 3(2P), then 4(3!P), and so on. Of course, B should be small enough so that Bwise ⊕addition can be performed in reasonable time.
 If we were able to finish all the calculations above without encountering noninvertible elements (mod n), then we need to try again with some other curve and starting point.
 If at some stage we found kP = ∞ (infinity on the elliptic curve), we should start over with a new curve and starting point, since this point ∞ is the group identity element, so is unchanged under any further addition operations.
 If we encountered a gcd(v, n) at some stage that was neither 1 nor n, then we are done: it is a nontrivial factor of n.
The time complexity depends on the size of the factor and can be represented by exp((√2 + o(1)) √ln p ln ln p), where p is the smallest factor of n, or , in Lnotation.
Why does the algorithm work?[edit]
If p and q are two prime divisors of n, then y^{2} = x^{3} + ax + b (mod n) implies the same equation also modulo p and modulo q. These two smaller elliptic curves with the addition are now genuine groups. If these groups have N_{p} and N_{q} elements, respectively, then for any point P on the original curve, by Lagrange's theorem, k > 0 is minimal such that on the curve modulo p implies that k divides N_{p}; moreover, . The analogous statement holds for the curve modulo q. When the elliptic curve is chosen randomly, then N_{p} and N_{q} are random numbers close to p + 1 and q + 1, respectively (see below). Hence it is unlikely that most of the prime factors of N_{p} and N_{q} are the same, and it is quite likely that while computing eP, we will encounter some kP that is ∞ modulo p but not modulo q, or vice versa. When this is the case, kP does not exist on the original curve, and in the computations we found some v with either gcd(v,p) = p or gcd(v, q) = q, but not both. That is, gcd(v, n) gave a nontrivial factor of n.
ECM is at its core an improvement of the older p − 1 algorithm. The p − 1 algorithm finds prime factors p such that p − 1 is bpowersmooth for small values of b. For any e, a multiple of p − 1, and any a relatively prime to p, by Fermat's little theorem we have a^{e} ≡ 1 (mod p). Then gcd(a^{e} − 1, n) is likely to produce a factor of n. However, the algorithm fails when p  1 has large prime factors, as is the case for numbers containing strong primes, for example.
ECM gets around this obstacle by considering the group of a random elliptic curve over the finite field Z_{p}, rather than considering the multiplicative group of Z_{p} which always has order p − 1.
The order of the group of an elliptic curve over Z_{p} varies (quite randomly) between p + 1 − 2√p and p + 1 + 2√p by Hasse's theorem, and is likely to be smooth for some elliptic curves. Although there is no proof that a smooth group order will be found in the Hasseinterval, by using heuristic probabilistic methods, the Canfield–Erdős–Pomerance theorem with suitably optimized parameter choices, and the Lnotation, we can expect to try L[√2/2, √2] curves before getting a smooth group order. This heuristic estimate is very reliable in practice.
An example[edit]
The following example is from Trappe & Washington (2006), with some details added.
We want to factor n = 455839. Let's choose the elliptic curve y^{2} = x^{3} + 5x – 5, with the point P = (1, 1) on it, and let's try to compute (10!)P.
The slope of the tangent line at some point A=(x, y) is s = (3x^{2} + 5)/(2y) (mod n). Using s we can compute 2A. If the value of s is of the form a/b where b > 1 and gcd(a,b) = 1, we have to find the modular inverse of b. If it does not exist, gcd(n,b) is a nontrivial factor of n.
First we compute 2P. We have s(P) = s(1,1) = 4, so the coordinates of 2P = (x′, y′) are x′ = s^{2} – 2x = 14 and y′ = s(x – x′) – y = 4(1 – 14) – 1 = –53, all numbers understood (mod n). Just to check that this 2P is indeed on the curve: (–53)^{2} = 2809 = 14^{3} + 5·14 – 5.
Then we compute 3(2P). We have s(2P) = s(14,53) = –593/106 (mod n). Using the Euclidean algorithm: 455839 = 4300·106 + 39, then 106 = 2·39 + 28, then 39 = 28 + 11, then 28 = 2·11 + 6, then 11 = 6 + 5, then 6 = 5 + 1. Hence gcd(455839, 106) = 1, and working backwards (a version of the extended Euclidean algorithm): 1 = 6 – 5 = 2·6 – 11 = 2·28 – 5·11 = 7·28 – 5·39 = 7·106 – 19·39 = 81707·106 – 19·455839. Hence 106^{−1} = 81707 (mod 455839), and –593/106 = –133317 (mod 455839). Given this s, we can compute the coordinates of 2(2P), just as we did above: 4P = (259851, 116255). Just to check that this is indeed a point on the curve: y^{2} = 54514 = x^{3} + 5x – 5 (mod 455839). After this, we can compute .
We can similarly compute 4!P, and so on, but 8!P requires inverting 599 (mod 455839). The Euclidean algorithm gives that 455839 is divisible by 599, and we have found a factorization 455839 = 599·761.
The reason that this worked is that the curve (mod 599) has 640 = 2^{7}·5 points, while (mod 761) it has 777 = 3·7·37 points. Moreover, 640 and 777 are the smallest positive integers k such that kP = ∞ on the curve (mod 599) and (mod 761), respectively. Since 8! is a multiple of 640 but not a multiple of 777, we have 8!P = ∞ on the curve (mod 599), but not on the curve (mod 761), hence the repeated addition broke down here, yielding the factorization.
The algorithm with projective coordinates[edit]
Before considering the projective plane over /~, first consider a 'normal' projective space over ℝ: Instead of points, lines through the origin are studied. A line may be represented as a nonzero point , under an equivalence relation ~ given by: ~ ⇔ ∃ c ≠ 0 such that x' = cx, y' = cy and z' = cz. Under this equivalence relation, the space is called the projective plane ; points, denoted by , correspond to lines in a threedimensional space that pass through the origin. Note that the point does not exist in this space since to draw a line in any possible direction requires at least one of x',y' or z' ≠ 0. Now observe that almost all lines go through any given reference plane  such as the (X,Y,1)plane, whilst the lines precisely parallel to this plane, having coordinates (X,Y,0), specify directions uniquely, as 'points at infinity' that are used in the affine (X,Y)plane it lies above.
In the algorithm, only the group structure of an elliptic curve over the field ℝ is used. Since we do not necessarily need the field ℝ, a finite field will also provide a group structure on an elliptic curve. However, considering the same curve and operation over /~ with n not a prime does not give a group. The Elliptic Curve Method makes use of the failure cases of the addition law.
We now state the algorithm in projective coordinates. The neutral element is then given by the point at infinity . Let n be a (positive) integer and consider the elliptic curve (a set of points with some structure on it) .
 Pick in (a ≠ 0).
 Calculate . The elliptic curve E is then in Weierstrass form given by and by using projective coordinates the elliptic curve is given by the homogeneous equation . It has the point .
 Choose an upperbound for this elliptic curve. Remark: You will only find factors p if the group order of the elliptic curve E over (denoted by #) is Bsmooth, which means that all prime factors of # have to be less or equal to B.
 Calculate .
 Calculate (k times) in the ring . Note that if # is Bsmooth and n is prime (and therefore is a field) that . However, if only # is Bsmooth for some divisor p of n, the product might not be (0:1:0) because addition and multiplication are not welldefined if n is not prime. In this case, a nontrivial divisor can be found.
 If not, then go back to step 2. If this does occur, then you will notice this when simplifying the product .
In point 5 it is said that under the right circumstances a nontrivial divisor can be found. As pointed out in Lenstra's article (Factoring Integers with Elliptic Curves) the addition needs the assumption . If are not and distinct (otherwise addition works similarly, but is a little different), then addition works as follows:
 To calculate: , ,
 ,
 ,
 ,
 .
If addition fails, this will be due to a failure calculating . In particular, because can not always be calculated if n is not prime (and therefore is not a field). Without making use of being a field, one could calculate:
 ,
 ,
 ,
 , and simplify if possible.
This calculation is always legal and if the gcd of the Zcoordinate with n ≠ (1 or n), so when simplifying fails, a nontrivial divisor of n is found.
Twisted Edwards curves[edit]
The use of Edwards curves needs fewer modular multiplications and less time than the use of Montgomery curves or Weierstrass curves (other used methods). Using Edwards curves you can also find more primes.
Definition: Let be a field in which , and let with . Then the twisted Edwards curve is given by An Edwards curve is a twisted Edwards curve in which .
There are five known ways to build a set of point on an Edwards curve: the set of affine points, the set of projective points, the set of inverted points, the set of extended points and the set of completed points.
The set of affine points is given by: .
The addition law is given by . The point (0,1) is its neutral element and the negative of is . The other representations are defined similar to how the projective Weierstrass curve follows from the affine.
Any elliptic curve in Edwards form has a point of order 4. So the torsion group of an Edwards curve over is isomorphic to either or .
The most interesting cases for ECM are and , since they force the group orders of the curve modulo primes to be divisible by 12 and 16 respectively. The following curves have a torsion group isomorphic to :
 with point where and
 with point where and
Every Edwards curve with a point of order 3 can be written in the ways shown above. Curves with torsion group isomorphic to and can be found on http://eprint.iacr.org/2008/016, top of page 30.
Stage 2[edit]
The above text is about the first stage of elliptic curve factorisation. There one hopes to find a prime divisor p such that is the neutral element of . In the second stage one hopes to have found a prime divisor q such that has small prime order in .
We hope the order to be between and , where is determined in stage 1 and is new stage 2 parameter. Checking for a small order of , can be done by computing modulo n for each prime l.
Success probability using EECMMPFQ[edit]
For speedup techniques using Edward curves and implementation results, see: http://eprint.iacr.org/2008/016 pages 30–32.
Hyperelliptic curve method (HECM)[edit]
There are recent developments in using hyperelliptic curves to factor integers. Cosset shows in his article (of 2010) that one can build a hyperelliptic curve with genus two (so a curve with f of degree 5) which gives the same result as using two 'normal' elliptic curves at the same time. By making use of the Kummer Surface calculation is more efficient. The disadvantages of the hyperelliptic curve (versus an elliptic curve) are compensated by this alternative way of calculating. Therefore, Cosset roughly claims that using hyperelliptic curves for factorization is no worse than using elliptic curves.
See also[edit]
 UBASIC for practical program (ECMX).
References[edit]
 Bernstein, Daniel J.; Birkner, Peter; Lange, Tanja; Peters, Christiane (2013). "ECM using Edwards curves". Mathematics of Computation 82 (282): 1139–1179. doi:10.1090/S002557182012026330. MR 3008853.
 Bosma, W.; Hulst, M. P. M. van der (1990). Primality proving with cyclotomy. Ph.D. Thesis, Universiteit van Amsterdam. OCLC 256778332.
 Brent, Richard P. (1999). "Factorization of the tenth Fermat number". Mathematics of Computation 68 (225): 429–451. doi:10.1090/S0025571899009928. MR 1489968.
 Cohen, Henri (1993). A Course in Computational Algebraic Number Theory. Berlin: SpringerVerlag. doi:10.1007/9783662029459. ISBN 0387556400. MR 1228206.
 Cosset, R. (2010). "Factorization with genus 2 curves". Mathematics of Computation 79 (270): 1191–1208. doi:10.1090/S0025571809022959. MR 2600562.
 Lenstra, A. K.; Lenstra Jr., H. W., eds. (1993). The development of the number field sieve. Lecture Notes in Mathematics 1554. Berlin: SpringerVerlag. doi:10.1007/BFb0091534. MR 1321216.
 Lenstra Jr., H. W. (1987). "Factoring integers with elliptic curves". Annals of Mathematics 126 (3): 649–673. doi:10.2307/1971363. MR 0916721.
 Pomerance, Carl; Crandall, Richard (2005). Prime Numbers: A Computational Perspective (Second ed.). New York: Springer. ISBN 0387252827. MR 2156291.
 Pomerance, Carl (1985). "The quadratic sieve factoring algorithm". Advances in Cryptology, Proc. Eurocrypt '84. Lecture Notes in Computer Science 209. Berlin: SpringerVerlag. pp. 169–182. doi:10.1007/3540397574_17. MR 0825590.
 Pomerance, Carl (1996). "A Tale of Two Sieves" (PDF). Notices of the American Mathematical Society 43 (12): 1473–1485. MR 1416721.
 Silverman, Robert D. (1987). "The Multiple Polynomial Quadratic Sieve". Mathematics of Computation 48 (177): 329–339. doi:10.1090/S00255718198708661198. MR 0866119.
 Trappe, W.; Washington, L. C. (2006). Introduction to Cryptography with Coding Theory (Second ed.). Saddle River, NJ: Pearson Prentice Hall. ISBN 0131862391. MR 2372272.
 Watras, Marcin (2008). Cryptography, Number Analysis, and Very Large Numbers. Bydgoszcz: WojciechowskiSteinhagen. PL:5324564.
External links[edit]
 Factorization using the Elliptic Curve Method, a Java applet which uses ECM and switches to the SelfInitializing Quadratic Sieve when it is faster.
 GMPECM, an efficient implementation of ECM.
 ECMNet, an easy clientserver implementation that works with several factorization projects.
 pyecm, a python implementation of ECM. Much faster with psyco and/or gmpy.
 Distributed computing project yoyo@Home Subproject ECM is a program for Elliptic Curve Factorization which is used by a couple of projects to find factors for different kind of numbers.
 Lenstra Elliptic Curve Factorization algorithm source code Simple C and GMP Elliptic Curve Factorization Algorithm source code

This page uses Creative Commons Licensed content from Wikipedia. A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.