> >The major breakthrough is solving a 400 year old
> > mathematical problem � how to positively identify a prime
> > number without spending exponential time in dividing the
> > number by all the primes up to its root.
>
> This problem was solved by a primality testing algorithm that is based on
> eliptic curves (it was not practical), but it was polynomial.
>
This is not correct. ECPP is polynomial, but it is _not_ deterministic, in fact pretty
far from that. We are currently working at a deterministic polynoial time algorithm.
It requires some additional spices, compared to ECPP.
Preda
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
