From: ionels@mailcity.com (Ionel Santa) Subject: ECM factoring Date: 24 Feb 00 13:22:25 GMT Newsgroups: sci.math.numberthy Summary: [missing] I am trying to implement ECM and I would appreciate some advice about the method. What I do for the moment: supposing I try to factor N which has n bits, I generate x0,y0, A, B such as y0^2 = x0^3 + A*x0 + B (mod N). I know how to calculate (x0,y0)^M (in the group structure which results), except that I don't know exactly how to optimally choose M (for different n values). Also, I don't know the Peter Montgomery's fast modular multiplication algorithm for speeding up the process and I don't know which is supposed to be the second phase of ECM (before exponentiation). I would preffer short explanations instead of book refferrencies (because I don't know if I could find them in the library). thanks, Ionel Santa.