Abstract
The elliptic curve primality proving algorithm is one of the fastest practical algorithms for proving the primality of large numbers. Its fastest version, fastECPP, runs in heuristic time \(\widetilde{O}(({\rm log}N)^{4})\). The aim of this article is to describe new ideas used when dealing with very large numbers. We illustrate these with the primality proofs of some numbers with more than 10,000 decimal digits.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P (August 2002) (preprint), available at http://www.cse.iitk.ac.in/primality.pdf
Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Math. Comp. 61(203), 29–68 (1993)
Bernstein, D.J.: How to find small factors of integers (June 2002), Available at http://cr.yp.to/papers.html
Enge, A., Morain, F.: Comparing invariants for class fields of imaginary quadratic fields. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 252–266. Springer, Heidelberg (2002)
Enge, A., Morain, F.: Fast decomposition of polynomials with known Galois group. In: Fossorier, M.P.C., Høholdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol. 2643, pp. 254–264. Springer, Heidelberg (2003)
Enge, A., Schertz, R.: Constructing elliptic curves from modular curves of positive genus. Soumis (2001)
Frigo, M., Johnson, S.G.: The fastest Fourier transform in the west. Technical Report MIT-LCS-TR-728, Massachusetts Institute of Technology (September 1997)
Frigo, M., Johnson, S.G.: FFTW: An adaptive software architecture for the FFT. In: Proc. 1998 IEEE Intl. Conf. Acoustics Speech and Signal Processing, vol. 3, pp. 1381–1384. IEEE, Los Alamitos (1998)
Hanrot, G., Morain, F.: Solvability by radicals from an algorithmic point of view. In: Mourrain, B. (ed.) Symbolic and algebraic computation, pp. 175–182. ACM, New York (2001); Proceedings ISSAC 2001, London, Ontario
Montgomery, P.L.: Modular multiplication without trial division. Math. Comp. 44, 519–521 (1985)
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)
Morain, F.: Computing the cardinality of CM elliptic curves using torsion points (October 2002) (submitted)
Morain, F.: Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (June 2003), Available at http://www.lix.polytechnique.fr/Labo/Francois.Morain/
Ram Murty, M.: Problems in Analytic Number Theory. Graduate Texts in Mathematics, vol. 206. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franke, J., Kleinjung, T., Morain, F., Wirth, T. (2004). Proving the Primality of Very Large Numbers with fastECPP. In: Buell, D. (eds) Algorithmic Number Theory. ANTS 2004. Lecture Notes in Computer Science, vol 3076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24847-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-24847-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22156-2
Online ISBN: 978-3-540-24847-7
eBook Packages: Springer Book Archive