http://code.activestate.com/recipes/users/4172899/2011-01-17T18:42:06-08:00ActiveState Code Recipes2011-01-17T18:42:06-08:00Mukesh Tiwarihttp://code.activestate.com/recipes/users/4172899/http://code.activestate.com/recipes/577544-elliptic-curve-prime-factorisation/

<p style="color: grey"> Python recipe 577544 by <a href="/recipes/users/4172899/">Mukesh Tiwari</a> (<a href="/recipes/tags/primality_testing/">primality_testing</a>). Revision 3. </p> <p>Hello all, I implemented this using Wikipedia [http://en.wikipedia.org/wiki/Lenstra_elliptic_curve_factorization] and some codes from google code search[extended_gcd and gcd].In my opinion, this code is not optimized and can be further improved. Feel free to post your comment. Thank You</p>

2010-02-10T10:02:51-08:00Mukesh Tiwarihttp://code.activestate.com/recipes/users/4172899/http://code.activestate.com/recipes/577037-pollard-rho-prime-factorization/

<p style="color: grey"> Python recipe 577037 by <a href="/recipes/users/4172899/">Mukesh Tiwari</a> (<a href="/recipes/tags/algorithm/">algorithm</a>, <a href="/recipes/tags/algorithms/">algorithms</a>). Revision 4. </p> <p>This code is implementation of Pollard Rho prime factorization. As i am a bit new in python so further improvement is appreciated.Also added Brent variant.</p>