Re: Elliptic curve factoring

Why don't you put it just online and send the URL. I hope you have at 
least tried to write that up in a pamphlet style way?

Ralf

On 07/10/2007 03:08 PM, Alasdair McAndrew wrote:
> I have written some highly unoptimized code for factoring integers using 
> Lenstra's elliptic curve method, with the "birthday paradox" phase two 
> developed by Richard Brent.  Even at this stage, it can factor the 
> seventh Fermat number 2^2^7+1 in 352 seconds, as opposed to 1877 seconds 
> by the in-built factoring method.  If anybody is interesting in 
> developing this code further, do let me know.