...

AFICT, the proposed algorithm is for a test for primality and does not represent an algorithm to factor composites.<< Lucky Yes, the paper is quite readable. The "futuristic" conjecture is that

primes can be proved in O(log^3(n)) time, but the algorithm as presented is O(log^12(n)) time. The authors admit that present probabalistic algorithms are faster. However, it presents a new way to think about the problem, so it opens the door for a lot of new research. Time will tell if that leads to new factoring algorithms. Is Pollard still interested? Maybe somebody should drop off the paper and a new computer at his house :-) << Dr Mike. Writings on the wall ptrei.Even without idquantique,the most trusted name in security