Proving primality in essentially quartic random time

This paper presents an algorithm that, given a prime n, finds and verifies a proof of the primality of n in random time (lg n) 4+o(1) . Several practical speedups are incorporated into the algorithm and discussed in detail.

[1]  Qi Cheng,et al.  On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract) , 2004, FOCS.

[2]  Joe Kilian,et al.  Almost all primes can be quickly certified , 1986, STOC '86.

[3]  Martin Mačaj,et al.  Some remarks and questions about the AKS algorithm and related conjecture , 2002 .

[4]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[5]  Joe Kilian,et al.  Primality testing using elliptic curves , 1999, JACM.

[6]  Pedro Berrizbeitia,et al.  Sharpening "Primes is in P" for a large family of numbers , 2002, Math. Comput..

[7]  Manindra Agrawal,et al.  PRIMES is in P , 2004 .

[8]  Proceedings of the 18th Annual ACM Symposium on Theory of Computing, May 28-30, 1986, Berkeley, California, USA , 1986, STOC.

[9]  Qi Cheng.  On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields , 2004, CRYPTO.

[10]  N F Fjortoft,et al.  Comparison of Activities and Attitudes of Baccalaureate Level and Entry-Level Doctor of Pharmacy Graduates of the University of Illinois at Chicago , 1995, The Annals of pharmacotherapy.

[11]  M.R. Fellows,et al.  Self-witnessing polynomial-time complexity and prime factorization , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[12]  L. Adleman,et al.  On distinguishing prime numbers from composite numbers , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[13]  Ronald L. Graham,et al.  The Mathematics of Paul Erdős II , 1997 .

[14]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .

[15]  Kurt Mehlhorn,et al.  Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity , 1990 .

[16]  Daniel J. Bernstein,et al.  Detecting perfect powers in essentially linear time , 1998, Math. Comput..

[17]  D. Bernstein.  DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS , 2022 .

[18]  Arjen K. Lenstra,et al.  Algorithms in Number Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[19]  François Morain,et al.  Finding suitable curves for the elliptic curve method of factorization , 1993 .

[20]  Qi Cheng,et al.  Primality Proving via One Round in ECPP and One Iteration in AKS , 2003, Journal of Cryptology.

[21]  Ming-Deh A. Huang,et al.  Primality Testing and Abelian Varieties over Finite Fields , 1992 .

[22]  Klaus W. Roggenkamp,et al.  Orders and their Applications , 1985 .

[23]  Daniel J. Bernstein,et al.  Detecting perfect powers by factoring into coprimes , 2007, Math. Comput..

[24]  Jan van Leeuwen,et al.  Handbook Of Theoretical Computer Science, Vol. A , 1990 .

[25]  Dj Daniel Bernstein.  Sharper ABC-based bounds for congruent polynomials , 2005 .

[26]  H. Lenstra,et al.  Galois theory and primality testing , 1985 .

[27]  José Felipe Voloch.  On some subgroups of the multiplicative group of finite rings , 2004 .