Lower-quality “industrial-grade primes ”with 512 binary digits can be produced in a fraction of a second using the Miller-Rabin test on an off-the-shelf 2GHz PC.If required,their primality can actually be proved in a couple of seconds with the ECPP-method of Atkin-Morain based on elliptic curves. The running-time complexity of this probabilistic algorithm is,to be sure,a “cloudy issue ”(Carl Pomerance),but heuristic considerations suggest that the likely value lies right around ˜O (log 6n ).
On the other hand,because of the high cost of the polynomial congruence in the third step of the AKS-algorithm, the constant in the conjectured ˜O (log 6n ) running-time bound is so large that the algorithm is estimated to take a couple of days on a 512-bit prime number,although Dan Bernstein, Hendrik Lenstra,Felipe Voloch,Bjorn Poonen,and Jeff Vaaler have already improved this constant by a factor of at least 2.10^6 relative to the original formulation of the algorithm —the status as of January 25,2003 [...].
Thus a factor of about 10^5 is missing to reach a competitive level.The ECPP-method too started with a completely impractical but groundbreaking new idea of Goldwasser and Kilian.Since the method that Agrawal,Kayal,and Saxena have now produced is so unexpectedly new and brilliant,we may confidently anticipate improved capabilities after further maturation of the algorithm.