On 7/10/07, 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.
I am very interested in helping to develop this code. One way that we could do that is to put it in a web page on the Axiom Wiki (like some of the other Axiom Contributions on the wiki). If you would like me to do this, just send me the code by email attachment. Or I would be happy to show you how to do it. Regards, Bill Page. _______________________________________________ Axiom-mail mailing list [email protected] http://lists.nongnu.org/mailman/listinfo/axiom-mail
