Finding good random elliptic curves for cryptosystems defined over if2n

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

Volumn 1233, Issue , 1997, Pages 379-392

  Lercier, Reynald ^a  

^a CELAR   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GEOMETRY;

CARDINALITIES; CRYPTOGRAPHIC SCHEMES; ELLIPTIC CURVE; FINITE FIELDS; S-ALGORITHMS; SPEED UP;

CRYPTOGRAPHY;

EID: 84957363701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69053-0_26     Document Type: Conference Paper

References (40)

1. A. Bender and G. Castagnoli. On the implementation of elliptic curve cryptosystems. In G. Brassard, editor, Advances in Cryptology, volume 435 of Lecture Notes in Comput. Set., pages 186-192. Springer-Verlag, 1989. Proc. Crypto’89, Santa Barbara, August 20-24.
2. J.-M. Couveignes, L. Dewaghe, and F. Morain. Isogeny cycles and the Schoof-Elkies-Atkin algorithm. Research Report LIX/RR/96/03, LIX, April 1996.
3. B. W. Char, K. O. Geddes, G. H. Gonnet, and S. M. Watt. MAPLE Reference Manual, Fourth Edition. Symbolic Computation Group, Department of Computer Science, University of Waterloo, 1985.
4. F. Chabaud and R. Lercier. A new toolbox for finite extensions of finite fields. Rapport technique, Laboratoire d’Informatique de l’Ecole polytechnique (LIX), 1996. In preparation.
5. F. Chabaud and R. Lercier. ZEN, User Manual. Laboratoire d’Informatique de l’Ecole polytechnique (LIX), 1996. Available at http://lix.polytechnique.fr/~zen/.
6. J.-M. Couveignes and F. Morain. Schoof’s algorithm and isogeny cycles. In L. Adleman and M.-D. Huang, editors, ANTS-I, volume 877 of Lecture Notes in Comput. Sci., pages 43-58. Springer-Verlag, 1994. 1st Algorithmic Number Theory Symposium-Cornell University, May 6-9, 1994.
7. J.-M. Couveignes. Quelques calculs en theorie des nombres. These, University de Bordeaux I, July 1994.
8. J.-M. Couveignes. Computing/-isogenies with the p-torsion. In H. Cohen, editor, ANTS-II, volume 1122 of Lecture Notes in Comput. Sci., pages 59-65. Springer-Verlag, 1996.
9. J. M. Couveignes. Isomorphisms between towers of artin-schreier exeten-sions over a finite fields. Draft, 1997.
10. J. Chao, K. Tanada, and S. Tsujii. Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks. In Y. Desmedt, editor, Advances in Cryptology-CRYPTO’94, volume 839 of Lecture Notes in Comput. Sci., pages 50-55. Springer-Verlag, 1994. Proc. 14th Annual International Cryptology Conference, Santa Barbara, Ca, USA, August 21-25.
11. G. Harper, A. Menezes, and S. Vanstone. Public-key cryptosystems with very small key length. In R. A. Rueppel, editor, Advances in Cryptoloy-EUROCRYPT’92, volume 658 of Lecture Notes in Comput. Sci., pages 163-173. Springer-Verlag, 1993. Workshop on the Theory and Application of Cryptographic Techniques, Balatonfiired, Hungary, May 24-28, 1992, Proceedings.
12. E. W. Howe. On the group orders of elliptic curves over finite fields. Com-positio Mathematica, 85:229-247, 1993.
13. B. S. Kaliski, Jr. A pseudo-random bit generator based on elliptic logarithms. In Proc. Crypto 86, volume 263 of Lecture Notes in Comput. Sci., 1986. Proceedings Crypto’86, Santa Barbara (USA), August 11-15, 1986.
14. N. Koblitz. Elliptic curve cryptosystems. Math. Comp., 48(177):203-209, January 1987.
15. N. Koblitz. Primality of the number of points on an elliptic curve over a finite field. Pacific Journal of Mathematics, 131(1):157-165, 1988.
16. N. Koblitz. Elliptic curve implementation of zero-knowledge blobs. Journal of Cryptology, 4(3):207-213, 1991.
17. H. W. Lenstra, Jr. Factoring integers with elliptic curves. Annals of Math., 126:649-673, 1987.
18. R. Lercier. Computing isogenies in GF(2"). In H. Cohen, editor, ANTS-II, volume 1122 of Lecture Notes in Comput. Sci., pages 197-212. Springer-Verlag, 1996.
19. R. Lercier. Courbes elliptiques et cryptographie. These, Ecole polytechnique, 1997. Draft.
20. R. Lercier and F. Morain. Counting the number of points on elliptic curves over finite fields: strategies and performances. In L. C. Guillou and J.-J. Quisquater, editors, Advances in Cryptology-EUROCRYPT’95, number 921 in Lecture Notes in Comput. Sci., pages 79-94, 1995. International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 1995, Proceedings.
21. R. Lercier and F. Morain. Counting the number of points on elliptic curves over Fp» using Couveignes’s algorithm. Rapport de Recherche LIX/RR/95/09, Laboratoire d’Informatique de l’Ecole polytechnique (LIX), 1995. Available at http://lix.polytechnique.ir/~mo-rain/Articles.
22. 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.
23. A. J. Menezes. Elliptic curve public key cryptosystems. Kluwer Academic Publishers, 1993.
24. V. Miller. Use of elliptic curves in cryptography. In A. M. Odlyzko, editor, Advances in Cryptology, volume 263 of Lecture Notes in Comput. Sci., pages 417-426. Springer-Verlag, 1987. Proceedings Crypto’86, Santa Barbara (USA), Augustll-15, 1986.
25. A. Miyaji. On ordinary elliptic curve cryptosystems. In Advances in Cryptology-ASIACRYPT’91, volume 739 of Lecture Notes in Comput. Sci., pages 50-55. Springer-Verlag, 1991.
26. A. Miyaji. Elliptic curves over Fp suitable for cryptosystems. In J. Seberry and Y. Zheng, editors, Advances in cryptology-AUSCRYPT’92, volume 718 of Lecture Notes in Comput. Sci., pages 479-491. Springer-Verlag, 1993. Workshop on the theory and application of cryptographic techniques, Gold Coast, Queensland, Australia, December 13-16, 1992.
27. F. Morain. Courbes elliptiques et tests de primalite. PhD thesis, Universite Claude Bernard-Lyon I, September 1990.
28. 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.
29. F. Morain. Classes d’isomorphismes des courbes elliptiques supersin-gulieres en caracteristique ≥ 3. To appear in Utilitas Mathematica. Available at http://lix.polytechnique.fr/~morain/, March 1996.
30. A. Menezes, T. Okamoto, and S. A. Vanstone. Reducing elliptic curves logarithms to logarithms in a finite field. IEEETIT, 39(5):1639-1646, 1993.
31. V. Muller. Ein Algorithmus zur Bestimmung der Punktanzahl elliptischer Kurven iiber endlichen Korpem der Charakteristik grofier drei. PhD thesis, Technischen Fakultat der Universitat des Saarlandes, 1995.
32. A. Menezes and S. A. Vanstone. The implementation of elliptic curve cryptosystems. In J. Seberry and J. Pieprzyk, editors, Advances in Cryptology, number 453 in Lecture Notes in Comput. Sci., pages 2-13. Springer-Verlag, 1990. Proceedings Auscrypt’90, Sysdney (Australia), January 1990.
33. A. J. Menezes, S. A. Vanstone, and R. J. Zuccherato. Counting points on elliptic curves over JFW. Math. Comp., 60(201):407-420, January 1993.
34. S. Pohlig and M. Heilman. An improved algorithm for computing logarithms over gf(p) and its cryptographic significance. IEEE Transactions on Information Theory, 24:106-110, 1978.
35. J. M. Pollard. Monte Carlo methods for index computation (mod p). Math. Comp., 32(143):918-924, July 1978.
36. R. Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp., 44:483-494, 1985.
37. R. Schoof. Counting points on elliptic curves over finite fields. J. Theor. Nombres Bordeaux, 7:219-254, 1995. Available at http://wvw.emath.fr/Maths/Jtnb/jtnbl995-l.html.
38. D. Shanks. Class number, a theory of factorization, and genera. In Proc. Symp. Pure Math. vol. 20, pages 415-440. AMS, 1971.
39. J. H. Silverman. The arithmetic of elliptic curves, volume 106 of Graduate Texts in Mathematics. Springer, 1986.
40. R. Schroeppel, H. Orman, S. O’Malley, and O. Spatscheck. Fast key exchange with elliptic curve systems. In Don Coppersmith, editor, Advances in Cryptology-CRYPTO’95, volume 963 of Lecture Notes in Comput. Sci., pages 44-56. Springer-Verlag, 1995.