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 Factors of Integers", of which I wrote a simple implementation just recently. Both algorithms perform admirably. Bernstein is certainly not a charlatan. I understand far too little of NFS to get any of the details of the paper, but if Bernstein's ideas should prove to work, it seems that all the experts' past predictions on the difficulty of integer factoring will look rather ridiculous ..again. I'm on the edge of my seat right now. I can't wait for the experts to comment this paper. Alex Henk Stokhorst wrote: > > 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
