For those of you interested in optimizing efficiency of LL testing:
We are approaching first time tests of 15.30M exponents, at which point the
Prime95 program will start using an 896K FFT. However, the P4-SSE2 section
of the program will start using that larger FFT size at 15.16M exponents,
maki
Well anything that can increase the speed of TF by even a wee amount is
welcome by me.
_
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
[EMAIL PROTECTED] wrote:
>
> On 26 Feb 2002, at 19:46, Henk Stokhorst wrote:
>
> > http://slashdot.org
> >
> > factoring breakthrough?
> >
> Doesn't look like a breakthrough, although there may be a very
> significant reduction in the amount of work required to factor
> "awkward" numbers.
>
> T
On 26 Feb 2002, at 19:46, Henk Stokhorst wrote:
> http://slashdot.org
>
> factoring breakthrough?
>
Doesn't look like a breakthrough, although there may be a very
significant reduction in the amount of work required to factor
"awkward" numbers.
The implications in terms of public key cryptog
That paper sounds like a genuine revolution.
I have looked at two papers of Bernstein before, "Prime Sieves Using
Binary Quadratic Forms" together with A.O.L. Atkin (algorithm a.k.a.
"Sieve of Atkin", implementation by Bernstein available under the name
"primegen"), and "How to Find Small Factor
http://slashdot.org
factoring breakthrough?
YotN,
Henk Stokhorst
_
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
