Implementing the asymptotically fast version of the elliptic curve primality proving algorithm

Morain, F.

doi:10.1090/S0025-5718-06-01890-4

Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
HTML articles powered by AMS MathViewer

by F. Morain PDF

Math. Comp. 76 (2007), 493-505

Abstract:

The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the primality of large numbers. Its running time currently cannot be proven rigorously, but heuristic arguments show that it should run in time $\tilde {O}((\log N)^5)$ to prove the primality of $N$. An asymptotically fast version of it, attributed to J. O. Shallit, is expected to run in time $\tilde {O}((\log N)^4)$. We describe this version in more detail, leading to actual implementations able to handle numbers with several thousands of decimal digits.

References

Leonard M. Adleman, Carl Pomerance, and Robert S. Rumely, On distinguishing prime numbers from composite numbers, Ann. of Math. (2) 117 (1983), no. 1, 173–206. MR 683806, DOI 10.2307/2006975
Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, PRIMES is in P, Ann. of Math. (2) 160 (2004), no. 2, 781–793. MR 2123939, DOI 10.4007/annals.2004.160.781
A. O. L. Atkin and F. Morain, Elliptic curves and primality proving, Math. Comp. 61 (1993), no. 203, 29–68. MR 1199989, DOI 10.1090/S0025-5718-1993-1199989-X
Mohamed Ayad, Points $S$-entiers des courbes elliptiques, Manuscripta Math. 76 (1992), no. 3-4, 305–324 (French). MR 1185022, DOI 10.1007/BF02567763
D. Bernstein. Proving primality after Agrawal-Kayal-Saxena. http://cr.yp.to/papers/aks.ps, January 2003.
D. Bernstein. Proving primality in essentially quartic expected time. http://cr.yp.to/papers/quartic.ps, January 2003.
Pedro Berrizbeitia, Sharpening “PRIMES is in $P$” for a large family of numbers, Math. Comp. 74 (2005), no. 252, 2043–2059. MR 2164112, DOI 10.1090/S0025-5718-05-01727-8
Reinier Bröker and Peter Stevenhagen, Elliptic curves with a given number of points, Algorithmic number theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 117–131. MR 2137348, DOI 10.1007/978-3-540-24847-7_{8}
Qi Cheng, Primality proving via one round in ECPP and one iteration in AKS, Advances in cryptology—CRYPTO 2003, Lecture Notes in Comput. Sci., vol. 2729, Springer, Berlin, 2003, pp. 338–348. MR 2093202, DOI 10.1007/978-3-540-45146-4_{2}0
H. Cohen and H. W. Lenstra Jr., Heuristics on class groups of number fields, Number theory, Noordwijkerhout 1983 (Noordwijkerhout, 1983) Lecture Notes in Math., vol. 1068, Springer, Berlin, 1984, pp. 33–62. MR 756082, DOI 10.1007/BFb0099440
H. Cohen and H. W. Lenstra Jr., Primality testing and Jacobi sums, Math. Comp. 42 (1984), no. 165, 297–330. MR 726006, DOI 10.1090/S0025-5718-1984-0726006-X
Jean-Marc Couveignes and Thierry Henocq, Action of modular correspondences around CM points, Algorithmic number theory (Sydney, 2002) Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 234–243. MR 2041087, DOI 10.1007/3-540-45455-1_{1}9
David A. Cox, Primes of the form $x^2 + ny^2$, A Wiley-Interscience Publication, John Wiley & Sons, Inc., New York, 1989. Fermat, class field theory and complex multiplication. MR 1028322
Richard Crandall and Carl Pomerance, Prime numbers, Springer-Verlag, New York, 2001. A computational perspective. MR 1821158, DOI 10.1007/978-1-4684-9316-0
A. Enge. The complexity of class polynomial computations via floating point approximations. Preprint, February 2004.
Andreas Enge and François Morain, Comparing invariants for class fields of imaginary quadratric fields, Algorithmic number theory (Sydney, 2002) Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 252–266. MR 2041089, DOI 10.1007/3-540-45455-1_{2}1
Andreas Enge and François Morain, Fast decomposition of polynomials with known Galois group, Applied algebra, algebraic algorithms and error-correcting codes (Toulouse, 2003) Lecture Notes in Comput. Sci., vol. 2643, Springer, Berlin, 2003, pp. 254–264. MR 2043632, DOI 10.1007/3-540-44828-4_{2}7
Andreas Enge and Reinhard Schertz, Modular curves of composite level, Acta Arith. 118 (2005), no. 2, 129–141. MR 2141046, DOI 10.4064/aa118-2-3
A. Enge and P. Zimmermann. mpc — a library for multiprecision complex arithmetic with exact rounding, 2002. Version 0.4.1, available from http://www.lix.polytechnique.fr/Labo/Andreas.Enge.
J. Franke, T. Kleinjung, F. Morain, and T. Wirth, Proving the primality of very large numbers with fastECPP, Algorithmic number theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 194–207. MR 2137354, DOI 10.1007/978-3-540-24847-7_{1}4
J. Franke, T. Kleinjung, F. Morain, and T. Wirth. A new large primality proof using fastecpp. http://listserv.nodak.edu/archives/nmbrthry.html, July 2004.
W. F. Galway. Analytic computation of the prime-counting function. Ph.D. thesis, University of Urbana-Champaign, 2004. http://www.math.uiuc.edu/~galway/PhD_Thesis/.
Joachim von zur Gathen and Jürgen Gerhard, Modern computer algebra, Cambridge University Press, New York, 1999. MR 1689167
Alice Gee, Class invariants by Shimura’s reciprocity law, J. Théor. Nombres Bordeaux 11 (1999), no. 1, 45–72 (English, with English and French summaries). Les XXèmes Journées Arithmétiques (Limoges, 1997). MR 1730432
Alice Gee and Peter Stevenhagen, Generating class fields using Shimura reciprocity, Algorithmic number theory (Portland, OR, 1998) Lecture Notes in Comput. Sci., vol. 1423, Springer, Berlin, 1998, pp. 441–453. MR 1726092, DOI 10.1007/BFb0054883
GNU. The GNU Multiple Precision arithmetic library. Available from http://www.swox.com/gmp/.
Shafi Goldwasser and Joe Kilian, Primality testing using elliptic curves, J. ACM 46 (1999), no. 4, 450–472. MR 1812127, DOI 10.1145/320211.320213
G. Hanrot, V. Lefèvre, and P. Zimmermann et. al. mpfr — a library for multiple-precision floating-point computations with exact rounding, 2002. Version contained in gmp. Available from http://www.mpfr.org.
G. Hanrot and F. Morain, Solvability by radicals from an algorithmic point of view, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2001, pp. 175–182. MR 2049746, DOI 10.1145/384101.384125
A. K. Lenstra and H. W. Lenstra Jr., Algorithms in number theory, Handbook of theoretical computer science, Vol. A, Elsevier, Amsterdam, 1990, pp. 673–715. MR 1127178
H. W. Lenstra, Jr. and C. Pomerance. Primality testing with Gaussian periods. Preprint. Available as http://www.math.dartmouth.edu/~carlp/PDF/complexity072805.pdf, July 2005.
Stéphane Louboutin, Computation of class numbers of quadratic number fields, Math. Comp. 71 (2002), no. 240, 1735–1743. MR 1933052, DOI 10.1090/S0025-5718-01-01367-9
P. Mihăilescu. Fast convolutions meet Montgomery. Preprint, March 2004.
P. Mihăilescu and R. Avanzi. Efficient quasi-deterministic primality test improving AKS. Available from http://www-math.uni-paderborn.de/~preda/papers/myaks1.ps, April 2003.
F. Morain, Primality proving using elliptic curves: an update, Algorithmic number theory (Portland, OR, 1998) Lecture Notes in Comput. Sci., vol. 1423, Springer, Berlin, 1998, pp. 111–127. MR 1726064, DOI 10.1007/BFb0054855
François Morain, La primalité en temps polynomial (d’après Adleman, Huang; Agrawal, Kayal, Saxena), Astérisque 294 (2004), viii, 205–230 (French, with French summary). MR 2111645
Władysław Narkiewicz, Elementary and analytic theory of algebraic numbers, Monografie Matematyczne, Tom 57, PWN—Polish Scientific Publishers, Warsaw, 1974. MR 0347767
Abderrahmane Nitaj, L’algorithme de Cornacchia, Exposition. Math. 13 (1995), no. 4, 358–365 (French, with English summary). MR 1358213
Reinhard Schertz, Weber’s class invariants revisited, J. Théor. Nombres Bordeaux 14 (2002), no. 1, 325–343 (English, with English and French summaries). MR 1926005