Primality proving with elliptic curves

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

Volumn 4732 LNCS, Issue , 2007, Pages 319-333

  Théry, Laurent ^a   Hanrot, Guillaume ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CURVE FITTING; NUMBER THEORY;

ELLIPTIC CURVES; MATHEMATICAL OBJECTS;

THEOREM PROVING;

EID: 38049088755     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74591-4_24     Document Type: Conference Paper

References (23)

1. Boutin, S.: Using Reflection to Build Efficient and Certified Decision Procedures. In: Ito, T., Abadi, M. (eds.) TACS 1997. LNCS, vol. 1281, pp. 515-529. Springer, Heidelberg (1997)
2. Boyer, R.S., Moore, J.S.: Single-threaded objects in ACL2. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 9-27. Springer, Heidelberg (2001)
3. Buchberger, B.: Introduction to Gröbner Bases. In: Buchberger, B., Winkler, F. (eds.) Gröbner Bases and Applications, pp. 3-31. Cambridge University Press, Cambridge (1998)
4. Capani, A., Niesi, G., Robbiano, L.: Cocoa: Computations in commutative algebra, available at http://cocoa.dima.unige.it/
5. Cohen, H., Frey, G.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and Its Applications. Chapman & Hall / CRC (2005)
6. Créci, J., Pottier, L.: Gb: une procédure de décision pour le système Coq. In: JFLA'2004, pp. 83-90 (2004)
7. Friedl, S.: An elementary proof of the group law for elliptic curves. Excerpt from undergraduate thesis, Regensburg (1998), available at http ://www.labmath.uqam.ca/~friedl/papers/AAELLIPTIC. PDF
8. Goldwasser, S., Kilian, J.: Almost all primes can be quickly certified. In: Proceedings of the 18th STOC, pp. 316-329 (1986)
9. Grégoire, B., Théry, L.: A Purely Functional Library for Modular Arithmetic and its Application to Certifying Large Prime Numbers. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 423-437. Springer, Heidelberg (2006)
10. Grégoire, B., Théry, L., Werner, B.: A Computational Approach to Pocklington Certificates in Type Theory. In: Hagiya, M., Wadler, P. (eds.) FLOPS 2006. LNCS, vol. 3945, pp. 97-113. Springer, Heidelberg (2006)
11. Grégoire, B., Mahboubi, A.: Proving ring equalities done right in Coq. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 98-113. Springer, Heidelberg (2005)
12. Harrison, J.: HOL light: A tutorial introduction. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 265-269. Springer, Heidelberg (1996)
13. Harrison, J.: Complex quantifier elimination in HOL. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol. 2152, pp. 159-174. Springer, Heidelberg (2001)
14. Hurd, J.: Formalized elliptic curve cryptography, available at http://www.cl.cam.ac.uk/~jehl004/research/talks/elliptic-talk.pdf
15. Lenstra Jr., HW.: Factoring integers with elliptic curves. Ann. Math. 126, 649-673 (1987)
16. Leroy, X.: Objective Caml (1997), available at http://pauillac.inria.fr/ ocaml/
17. Martin, M.: PRIMO - primality proving, available at http://www.ellipsa. net/
18. 3 + 97220, available at http://www.lix.polytechnique.fr/Labo/Francois.Morain
19. Morain, F.: La primauté en temps polynomial, d'après Adleman, Huang; Agrawal, Kayal, Saxena. Séminaire Bourbaki, 3(55) (2002)
20. Ménissier-Morain, V.: The CAML Numbers Reference Manual. Technical Report 141, INRIA (1992)
21. Silverman, J.H.: The Arithmetic of Elliptic Curves. Springer, Heidelberg (1986)
22. The COQ development team: The Coq Proof Assistant Reference Manual v7.2. Technical Report 255, INRIA (2002), available at http://coq.inria.fr/doc
23. Théry, L.: Proving the group law for elliptic curves formally. Technical Report 330, INRIA (2007)