Primality proving using elliptic curves: An update

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1423, Issue , 1998, Pages 111-127

  Morain, F ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY;

COMPLEX MULTIPLICATION; ELLIPTIC CURVE; ELLIPTIC CURVES OVER FINITE FIELDS; PRIMALITY; PRIMALITY PROVING;

GEOMETRY;

EID: 84947787924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054855     Document Type: Conference Paper

References (38)

1. A. O. L. Atkin and F. Morain. Elliptic curves and primality proving. Math. Comp., 61(203):29-68, July 1993.
2. R. P. Brent and J. M. Pollard. Factorization of the eighth Fermat number. Math. Comp., 36(154):627-630, April 1981.
3. J. Chao, K. Harada, N. Matsuda, and S. Tsujii. Design of secure elliptic curves over extension fields with CM field method. In Proceedings of PRAGO-CRYPTO’96, pages 93-108, 1996.
4. J.-M. Couveignes, A. Joux, and F. Morain. Sur quelques sommes de caractères. In preparation, February 1994.
5. N. D. Elkies. Elliptic and modular curves over finite fields and related computational issues. In D. A. Buell and J. T. Teitelbaum, editors, Computational Perspectives on Number Theory: Proceedings of a Conference in Honor of A. O. L. Atkin, volume 7 of AMS/IP Studies in Advanced Mathematics, pages 21-76. American Mathematical Society, International Press, 1998.
6. A. Gee. Class invariants by Shimura’s reciprocity law. Preprint, 1998.
7. A. Gee and P. Stevenhagen. Generating class fields using Shimura reciprocity. To appear in the Proc. of ANTS-III, 1998.
8. S. Goldwasser and J. Kilian. Almost all primes can be quickly certified. In Proc. 18th STOC, pages 316-329. ACM, 1986. May 28-30, Berkeley.
9. T. Granlund and P. L. Montgomery. Division by invariant integers using multiplication. SIGPLAN Notices, 29(6):61-72, 1994.
10. 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, April 1989.
11. A. Joux and F. Morain. Sur les sommes de caractères liées aux courbes elliptiques à multiplication complexe. J. Number Theory, 55(1):108-128, November 1995.
12. S. A. Katre. Jacobsthal sums in terms of quadratic partitions of a prime. In K. Alladi, editor, Number Theory, volume 1122 of Lecture Notes in Math., pages 153-162. Springer-Verlag, 1985. Proceedings of the 4th Matscience Conference held at Ootacamund, India, January 5-10, 1984.
13. W. Keller and F. Morain. The complete factorization of some large Mersenne composites. Abstracts of the AMS, 13(5):506, October 1992. 92T-11-163.
14. G.-J. Lay and H. G. Zimmer. Constructing elliptic curves with given group order over large finite fields. In L. Adleman and M.-D. Huang, editors, ANTS-I, volume 877 of Lecture Notes in Comput. Sci., pages 250-263. Springer-Verlag, 1994. 1st Algorithmic Number Theory Symposium - Cornell University, May 6-9, 1994.
15. H. W. Lenstra, Jr. Factoring integers with elliptic curves. Ann. of Math. (2), 126:649-673, 1987.
16. F. Leprévost and F. Morain. Reveˆtements de courbes elliptiques à multiplication complexe par des courbes hyperelliptiques et sommes de caractères. J. Number Theory, 64:165-182, 1997.
17. R. Lercier. Algorithmique des courbes elliptiques dans les corps finis. Thèse, Ecole polytechnique, June 1997.
18. R. Lercier and F. Morain. Algorithms for computing isogenies between elliptic curves. In D. A. Buell and J. T. Teitelbaum, editors, Computational Perspectives on Number Theory: Proceedings of a Conference in Honor of A. O. L. Atkin, volume 7 of AMS/IP Studies in Advanced Mathematics, pages 77-96. American Mathematical Society, International Press, 1998.
19. A. J. Menezes. Elliptic curve public key cryptosystems. Kluwer Academic Publishers, 1993.
20. P. Mihăilescu. Advances in cyclotomy primality proving. Email to the NMBRTHRY mailing list; available on http://listserv.nodak.edu/eurchives/nmbrthry.html, November 1997.
21. P. Mihăilescu. Cyclotomy of rings and primality testing. Diss. ETH № 12278, Swiss Federal Institute of Technology Zürich, 1997.
22. P. Mihăilescu. Cyclotomy news. Email to the NMBRTHRY mailing list; available on http://listserv.nodak.edu/archives/nmbrthry.html, January 1998.
23. P. Mihăilescu. Cyclotomy primality proving - recent developments. To appear in the Proc. of ANTS-III, March 1998.
24. P. L. Montgomery. Modular multiplication without trial division. Math. Comp., 44(170):519-521, April 1985.
25. P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Math. Comp., 48(177):243-264, January 1987.
26. F. Morain. Courbes elliptiques et tests de primalité. Thèse, Université Claude Bernard-Lyon I, September 1990.
27. F. Morain. Building cyclic elliptic curves modulo large primes. In D. Davies, editor, Advances in Cryptology - EUROCRYPT '91, volume 547 of Lecture Notes in Comput. Sci., pages 328-336. Springer-Verlag, 1991. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques, Brighton, United Kingdom, April 8-11, 1991.
28. F. Morain. Prime values of partition numbers and the primality of p(1840926). Rapport de Recherche LIX/92/RR/11, Laboratoire d’informatique de l’Ecole Polytechnique (LIX), 1992.
29. F. Morain. (2* 10501+1)/3 is prime. Email to the NMBRTHRY mailing list; available on http://listserv.nodak.edu/archives/nmbrthry.html, April 1996.
30. F. Morain. (2* 12391+1)/3 is prime. Email to the NMBRTHRY mailing list; available on http://listserv.nodak.edu/archives/nmbrthry.html, April 1996.
31. F. Morain. Torsion points on CM elliptic curves and applications. Preprint, March 1998.
32. A. Nitaj. L’algorithme de Cornacchia. Exposition. Math., 13:358-365, 1995.
33. R. Padma and S. Venkataraman. Elliptic curves with complex multiplication and a character sum. J. Number Theory, 61:274-282, 1996.
34. R. Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp., 44:483-494, 1985.
35. J. H. Silverman. The arithmetic of elliptic curves, volume 106 of Graduate Texts in Mathematics. Springer, 1986.
36. J. H. Silverman. Advanced Topics in the Arithmetic of Elliptic Curves, volume 151 of Graduate Texts in Mathematics. Springer-Verlag, 1994.
37. H. M. Stark. Counting points on CM elliptic curves. Rocky Mountain J. Math., 26(3):1115-1138, 1996.
38. H. von Lienen. Reelle kubische und biquadratische Legendre-Symbole. J. Reine Angew. Math., 305:140-154, 1979.