Primality Proving via One Round in ECPP and One Iteration in AKS

  • Qi Cheng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2729)


On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic time Õ(log6 n). Verification takes roughly the same amount of time. On the other hand, the Elliptic Curve Primality Proving algorithm (ECPP), runs in random heuristic time Õ(log6 n) ( Õ(log5 n) if the fast multiplication is used), and generates certificates which can be easily verified. More recently, Berrizbeitia gave a variant of the AKS algorithm, in which some primes cost much less time to prove than a general prime does. Building on these celebrated results, this paper explores the possibility of designing a more efficient algorithm. A random primality proving algorithm with heuristic time complexity Õ(log4 n) is presented. It generates a certificate of primality which is Õ(log n) bits long and can be verified in deterministic time Õ(log4 n). The reduction in time complexity is achieved by first generalizing Berrizbeitia’s algorithm to one which has higher density of easily-proved primes. For a general prime, one round of ECPP is deployed to reduce its primality proof to the proof of a random easily-proved prime.


Time Complexity Prime Factor Elliptic Curve Elliptic Curf Fast Multiplication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Adleman, L.M., Huang, M.A.: Primality Testing and Abelian Varieties Over Finite Fields. Lecture Notes in Mathematics. Springer, Heidelberg (1992)zbMATHGoogle Scholar
  2. 2.
    Adleman, L.M., Pomerance, C., Rumely, R.S.: On distinguishing prime numbers from composite numbers. Annals of Mathematics 117, 173–206 (1983)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Agrawal, M., Kayal, N., Saxena, N.: Primes is in P (2002),
  4. 4.
    Atkin, A.O.L.: Lecture notes of a conference in Boulder, Colorado (1986)Google Scholar
  5. 5.
    Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Mathematics of Computation 61, 29–67 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bach, E., Shallit, J.: Algorithmic Number theory, vol. I. The MIT Press, Cambridge (1996)zbMATHGoogle Scholar
  7. 7.
    Berrizbeitia, P.: Sharpening “primes is in p” for a large family of numbers (2002),
  8. 8.
    Goldwasser, S., Kilian, J.: Almost all primes can be quickly certified. In: Proc. 18th ACM Symp. on Theory of Computing, Berkeley, CA, pp. 316–329. ACM, New York (1986)Google Scholar
  9. 9.
    Lenstra, A., Lenstra Jr., H.W.: Handbook of Theoretical Computer Science A. In: chapter Algorithms in Number Theory, pp. 673–715. Elsevier and MIT Press (1990)Google Scholar
  10. 10.
    Morain, F.: Primality proving using elliptic curves: An update. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 111–127. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  11. 11.
    Tenenbaum, G.: Introduction to analytic and probabilistic number theory (English Translation). Cambridge University Press, Cambridge (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Qi Cheng
    • 1
  1. 1.School of Computer ScienceThe University of OklahomaNormanUSA

Personalised recommendations