Re: Elliptic Code

Quite so - but thanks for your help in any case "Paul Rubin" wrote in message news:[EMAIL PROTECTED] > Nick Craig-Wood <[EMAIL PROTECTED]> writes: >> > I understand the algorithm quite well but how to code the >> > multiplication >> > stage most efficiently in python

Re: Elliptic Code

Nick Craig-Wood <[EMAIL PROTECTED]> writes: > > I understand the algorithm quite well but how to code the multiplication > > stage most efficiently in python eludes me. > > You might want to look at > > http://gmpy.sourceforge.net/ > > It has very fast multiplication up to any size you like

Re: Elliptic Code

Philip Smith <[EMAIL PROTECTED]> wrote: > I understand the algorithm quite well but how to code the multiplication > stage most efficiently in python eludes me. You might want to look at http://gmpy.sourceforge.net/ It has very fast multiplication up to any size you like! -- Nick Craig-Woo

Re: Elliptic Code

thanks for the suggestion I understand the algorithm quite well but how to code the multiplication stage most efficiently in python eludes me. William Stein's code is obviously not high performance because in the region where ecm should do well (30-40 dec digits) my python implementation of the

Re: Elliptic Code

"Philip Smith" <[EMAIL PROTECTED]> writes: > Does anyone have/know of a python implementation of the elliptic curve > factoring algorithm (lenstra) which is both: > > simply and cleanly coded > functional It's not in Python but take a look at Mike Scott's C++ implementation in MIRACL, http:/

Elliptic Code

Hi Does anyone have/know of a python implementation of the elliptic curve factoring algorithm (lenstra) which is both: simply and cleanly coded functional I'm aware of William Stein's code (from elementary number theory book) but I don't understand his coding style and the algorithm doesn't se