On Tuesday 26 June 2007 13:59, Alasdair McAndrew wrote: > I'm trying to implement Lenstra's elliptic curve method for factorization; > so far I have implemented "phase 1" using two methods: the standard > projective coordinate system; and the Montgomery-Suyama parameterization. > I'd like to get the latter working, but at the moment it works very poorly. > The first method seems to work OK. > > Does anybody know enough about this area to give me a hand? Then we could > add it to the integer factorization routine, which is pretty under-powered. > > Thanks, > Alasdair
Google "ecfact.as" for an Aldor implementation. ________________________________________________________________________ The Numerical Algorithms Group Ltd is a company registered in England and Wales with company number 1249803. The registered office is: Wilkinson House, Jordan Hill Road, Oxford OX2 8DR, United Kingdom. This e-mail has been scanned for all viruses by Star. The service is powered by MessageLabs. ________________________________________________________________________ _______________________________________________ Axiom-mail mailing list [email protected] http://lists.nongnu.org/mailman/listinfo/axiom-mail
