14.01.2011, 21:52, "mukesh tiwari" :
> Hello all , I have implemented Elliptic curve prime factorisation
> using wikipedia [
> http://en.wikipedia.org/wiki/Lenstra_elliptic_curve_factorization].
> I think that this code is not optimised and posting for further
> improvem
On Jan 15, 7:02 am, Steven D'Aprano wrote:
> On Fri, 14 Jan 2011 11:52:21 -0800, mukesh tiwari wrote:
> > Hello all , I have implemented Elliptic curve prime factorisation using
> > wikipedia [
> >http://en.wikipedia.org/wiki/Lenstra_elliptic_curve_factorization]. I
&
On Fri, Jan 14, 2011 at 11:52 AM, mukesh tiwari
wrote:
> Hello all , I have implemented Elliptic curve prime factorisation
> using wikipedia [
> http://en.wikipedia.org/wiki/Lenstra_elliptic_curve_factorization].
> I think that this code is not optimised and posting for further
&
On Fri, 14 Jan 2011 11:52:21 -0800, mukesh tiwari wrote:
> Hello all , I have implemented Elliptic curve prime factorisation using
> wikipedia [
> http://en.wikipedia.org/wiki/Lenstra_elliptic_curve_factorization]. I
> think that this code is not optimised and posting for further
&
Hello all , I have implemented Elliptic curve prime factorisation
using wikipedia [
http://en.wikipedia.org/wiki/Lenstra_elliptic_curve_factorization].
I think that this code is not optimised and posting for further
improvement. Feel free to comment and if you have any link regarding
Elliptic