Primality testing using elliptic curves

Journal of the ACM

Volumn 46, Issue 4, 1999, Pages 450-472

  Goldwasser, Shafi ^a,b,c   Kilian, Joe ^a,b,c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NEC LABORATORIES AMERICA   (United States)

^c Massachusetts Institute of Technology   (United States)

Author keywords

Distribution of primes; Elliptic curves; Group theory; Las vegas algorithms; Prime certification; Prime generation; Primes

Indexed keywords

DISTRIBUTION OF PRIMES; ELLIPTIC CURVES; GROUP THEORY; LAS VEGAS ALGORITHMS; PRIME CERTIFICATION; PRIME GENERATION; PRIMES;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; MATHEMATICAL MODELS; POLYNOMIALS; STATISTICAL METHODS;

TESTING;

EID: 0010697221     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/320211.320213     Document Type: Article

References (42)

1. ADLEMAN, L. M., AND HUANG, M. 1987. Recognizing primes in polynomial time. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (New York, N.Y., May 25-27). ACM, New York, pp. 462-471.
2. ADLEMAN, L. M., AND HUANG, M. 1992. Primality testing and Abelian varieties over finite fields. In Lecture Notes in Mathematics, vol. 1512. Springer-Verlag, New York.
3. ADLEMAN, L. M., MANDERS, K., AND MILLER, G. L. 1977. On taking roots in finite fields. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science. IEEE, New York, pp. 175-178.
4. ADLEMAN, L. M., POMERANCE, C., AND RUMELY, R. 1983. On distinguishing prime numbers from composite numbers. Ann. Math. 117, 173-206.
5. ATKIN, A. O. L. 1986a. Schoof's algorithm. Manuscript.
6. ATKIN, A. O. L. 1986b. Manuscript.
7. ATKIN, A. O. L. 1988. The number of points on an elliptic curve modulo a prime. Manuscript.
8. ATKIN, A. O. L. 1992. The number of points on an elliptic curve modulo a prime (II). Manuscript.
9. ATKIN, A. O. L., AND MORAIN, F. 1993. Elliptic curves and primality proving. Math. Comput. 61, 203 (July), 29-68.
10. BOSMA, W. 1985. Primality testing using elliptic curves. Tech. Rep. 8512. Math. Instituut, Univ. Amsterdam, Amsterdam, The Netherlands.
11. BOSMA, W., AND VAN DER HULST, M. P. 1990. Faster primality testing. In Proceedings of EUROC-RYPT '89. Lecture Notes in Computer Science, vol. 434. Springer-Verlag, New York, pp. 652-656.
12. m ± 1. Math. Comput. 29, 130, 620-647.
13. n + 1; b = 2, 3, 5, 6, 7, 10, 11, 12 up to high powers. Cont. Math. 2, 22.
14. CHUDNOVSKY, D., AND CHUDNOVSKY, G. 1986. Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv. App. Math. 7.
15. COHEN, H., AND LENSTRA, JR., H. W. 1984. Primality testing and Jacobi sums. Math. Comput. 42.
16. ELKIES, N. D. 1991. Explicit isogenies. Manuscript.
17. ELKIES, N. D. 1998. Elliptic and modular curves over finite fields and related computational issues. In Computational Perspectives on Number Theory: Proceedings of a Conference in Honor of A. O. L. Atkins, D. A. Buell and J. T. Teitelbaum, eds. AMS/IP Studies in Advanced Mathematics, vol. 7. American Mathematics Society, Providence, R. I., pp. 21-76.
18. GOLDWASSER, S., AND KILIAN, J. 1986. Almost all primes can be quickly certified. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing (Berkeley, Calif., May 28-30). ACM, New York, pp. 316-329.
19. HEATH-BROWN, D. R. 1978. The differences between consecutive primes. J. London Math. Soc. 2, 18, 7-13.
20. KALTOFEN, E., VALENTE, T., AND YUI, N. 1989. An improved Las Vegas primality test. In Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Compulation (ISSAC '89) (Portland, Ore., July 17-19), Gilt Gonnet, ed. ACM, New York, pp. 26-33.
21. KILIAN, J. 1990. Uses of Randomness in Algorithms and Protocols. MIT Press, Cambridge, Mass.
22. KONYAGIN, S., AND POMERANCE, C. 1997. On primes recognizable in deterministic polynomial time. In The Mathematics of Paul Erdös, R. Graham and J. Nešetřil, eds. Springer-Verlag, New York, pp. 177-198.
23. LENSTRA, JR., H. W. 1987. Factoring, integers with elliptic curves. Ann. Math. 126, 649-673.
24. LENSTRA, A., AND LENSTRA, JR., H. W. 1987. Algorithms in number theory. Tech. Rep. 87-008. Univ. Chicago, Chicago, 111.
25. LENSTRA, JR., H. W., PILA, J., AND POMERANCE, C. 1993. A hyperelliptic smoothness test, I. Philos. Trans. Roy Soc. London Ser. A 345, 397-408.
26. LENSTRA, JR., H. W., PILA, J., AND POMERANCE, C. 1999. A hyperelliptic smoothness test, II. Manuscript.
27. LENSTRA, JR., H. W., PILA, J., AND POMERANCE, C. 1999. A hyperelliptic smoothness test, III. To appear.
28. MIHAILESCU, P. 1994. Cyclotomy primality proving - Recent developments. In Proceedings of the 3rd International Algorithmic Number Theory Symposium (ANTS). Lecture Notes in Computer Science, vol. 877. Springer-Verlag, New York, pp. 95-110.
29. MILLER, G. L. 1976. Riemann's hypothesis and test for primality. J. Comput. Syst. Sci. 13, 300-317.
30. MORAIN, F. 1990. Courbes elliptques et tests de primalité. Ph.D. dissertation. Univ. Claude Bernard-Lyon I.
31. MORAIN, F. 1995. Calcul de nombre de points sur une courbe elliptique dans un corps fini: Aspects algorithmiques. J. Théor. Nombres Bordeaux 7, 255-282.
32. PINTZ, J., STEIGER, W., AND SZEMEREDI, E. 1989. Infinite sets of primes with fast primality tests and quick generation of large primes. Math. Comput. 53, 187, 399-406.
33. POMERANCE, C. 1987. Very short primality proofs. Math. Comput. 48, 177, 315-322.
34. PRATT, V. R. 1975. Every prime has a succinct certificate. SIAM J. Comput. 4, 3, 214-220.
35. RABIN, M. 1980. Probabilistic algorithms for testing primality. J. Numb. Theory 12, 128-138.
36. SCHOOF, R. 1985. Elliptic curves over finite fields and the computation of square roots modulo p. Math. Comput. 44, 483-494.
37. SCHOOF, R. 1995. Counting points on elliptic curves over finite fields. J. Théor. Nombres. Bordeaux 7, 219-254.
38. SILVERMAN, J. 1986. The arithmetic of elliptic curves. In Graduate Texts in Mathematics, vol. 106. Springer-Verlag, New York.
39. SOLOVAY, R., AND STRASSEN, V. 1977. A fast Monte-Carlo test for primality. SIAM J. Comput. 6, 1, 84-85.
40. TATE, J. 1974. The arithmetic of elliptic curves. Invent. Math. 23, 179-206.
41. WILLIAMS, H. C. 1978. Primality testing on a computer. Ars. Combinat. 5, 127-185.
42. WUNDERLICH, M. C. 1983. A performance analysis of a simple prime-testing algorithm. Math. Comput. 40, 162, 709-714.