Abstract
We make an attempt to compare the speed of some primality testing algorithms for certifying 100-digit prime numbers.
On leave from the French Department of Defense, Délégation Générale pour l’Armement.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
L. M. Adleman, C. Pomerance, and R. S. Rumely. On distinguishing prime numbers from composite numbers. Annals of Math., 117:173–206, 1983.
L. M. Adleman, R. L. Rivest, and A. Shamir. A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM, 21(2):120–126, 1978.
A. O. L. Atkin. Manuscript. August 1986.
P. Beauchemin, G. Brassard, C. Crépeau, C. Goutier, and C. Pomerance. The generation of random numbers that are probably prime. J. Cryptology, 1:53–64, 1988.
P. Bertin, D. Roncin, and J. Vuillemin. Introduction to programmable active memories. In Proc. of the Internat. Conf. on Systolic Arrays, 1989.
W. Bosma and M.-P. van der Hulst. Faster primality testing. In Proc. Eurocrypt’ 89, 1989.
J. Brillhart, D. H. Lehmer, and J. L. Selfridge. New primality criteria and factorizations of 2m ± 1. Math. of Comp., 29(130):620–647, 1975.
J. Brillhart, D. H. Lehmer, J. L. Selfridge, B. Tuckerman, and S. S. Wagstaff (Jr.). Factorizations of bn ± 1, b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers. Number 22 in Contemporary Mathematics. AMS, 1983.
J. W. S. Cassels. Diophantine equations with special references to elliptic curves. J. London Math. Soc., 41:193–291, 1966.
H. Cohen and Jr H. W. Lenstra. Primality testing and Jacobi sums. Math. of Comp., 42(165):297–330, 1984.
H. Cohen and A. K. Lenstra. Implementation of a new primality test. Math. of Comp., 48(177):103–121, 1987.
C. Couvreur and J.J. Quisquater. An introduction to fast generation of large prime numbers. Philips J. Research, 37:231–264, 1982.
W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. on Information Theory, IT-22-6, nov 1976.
S. Goldwasser and J. Kilian. Almost all primes can be quickly certified. In Proc. 18th STOC, pages 316–329, Berkeley, 1986.
D. Gordon. Strong primes are easy to find. In Proc. Eurocrypt’ 84, pages 216–223. Springer, 1984.
Jr. H. W. Lenstra. Factoring integers with elliptic curves. Annals of Math., 126:649–673, 1987.
J.-C. Hervé, F. Morain, D. Salesin, B. Serpette, J. Vuillemin, and P. Zimmermann. Bignum: A portable and efficient package for arbitrary precision arithmetic. Rapport de Recherche 1016, INRIA, avril 1989.
D. HusemXEoller. Elliptic curves, volume 111 of Graduate Texts in Mathematics. Springer, 1987.
D. E. Knuth. The Art of Computer Programming: Seminumerical Algorithms. Addison-Wesley, 1981.
A. K. Lenstra. Data concerning the implementation of the Jacobi sums algorithm on a cray-1. Personnal Communication, April 1989.
H. W. Lenstra. Elliptic curves and number theoretic algorithms. Technical Report Report 86-19, Math. Inst., Univ. Amsterdam, 1986.
U. M. Maurer. Fast generation of secure RSA-products with almost maximal diversity. In Proc. Eurocrypt’ 89, 1989.
F. Morain. Distributed primality proving. In preparation.
F. Morain. Implementation of the Atkin-Goldwasser-Kilian primality testing algorithm. Rapport de Recherche 911, INRIA, Octobre 1988.
F. Morain. Construction of Hilbert class fields of imaginary quadratic fields and dihedral equations modulo p. Rapport de Recherche 1087, INRIA, Septembre 1989.
F. Morain. Elliptic curves and primality proving. In preparation, 1989.
F. Morain. Résolution d’équations de petit degré modulo de grands nombres premiers. Rapport de Recherche 1085, INRIA, Septembre 1989.
F. Morain and J. Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Rapport de Recherche INRIA 983, INRIA, Mars 1989.
D. A. Plaisted. Fast verification, testing and generation of large primes. Theoretical Computre Science, 9:1–16, 1979.
C. Pomerance. Very short primality proofs. Math. of Comp., 48(177):315–322, 1987.
V. R. Pratt. Every prime has a succint certificate. SIAM J. Comput., 4:214–220, 1975.
R. Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Math. of Comp., 44:483–494, 1985.
J. T. Tate. The arithmetic of elliptic curves. Inventiones Math., 23:179–206, 1974.
M. C. Wunderlich. A performance analysis of a simple prime-testing algorithm. Math. of Comp., 40(162):709–714, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morain, F. (1990). Atkin’s Test: News from the Front. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_59
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive