Re: Elliptic curve factoring

Err, no, I haven't written it up in pamphlet style at all... my version of
Axiom (Timestamp: Wednesday June 21, 2006 at 03:45:56) doesn't seem to come
with any pamphlets.  The '*.spad.dvi" files just contain the text of the
*.spad files presented as dvi files.  All I really want to do is to extend
the methods in intfact.spad to include ecm - which the file itself
recommends.

-Alasdair

On 7/10/07, Ralf Hemmecke <[email protected]> wrote:
>
> 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.
>

_______________________________________________
Axiom-mail mailing list
[email protected]
http://lists.nongnu.org/mailman/listinfo/axiom-mail