Abstract
Cryptographic schemes using elliptic curves over finite fields require the computation of the cardinality of the curves. Dramatic progress have been achieved recently in that field by various authors. The aim of this article is to highlight part of these improvements and to describe an efficient implementation of them in the particular case of the fields GF(2n), for n ≤ 600.
On leave from the French Department of Defense, Délégation Générale pour l’Armement.
Part of this study was done under contract no0044193 with DGA/CELAR.
Chapter PDF
References
Aho, A. V., Hopcroft, J. E., and Ullman, J. D.The design and analysis of computer algorithms. Reading. Addison-Wesley, 1974.
Atkin, A. O. L. The number of points on an elliptic curve modulo a prime. Draft, 1988.
Atkin, A. O. L. The number of points on an elliptic curve modulo a prime (ii). Draft, 1992.
Atkin, A. O. L., and Morain, F. Elliptic curves and primality proving. Math. Comp. 61,203 (July 1993), 29–68.
Bender, A., and Castagnoli, G. On the implementation of elliptic curve cryptosystems. In Advances in Cryptology (1989), G. Brassard, Ed., vol. 435 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 186–192. Proc. Crypto’ 89, Santa Barbara, August 20–24.
Bosma, W. Primality testing using elliptic curves. Tech. Rep. 85-12, Math. Instituut, Universiteit van Amsterdam, 1985.
Chabaud, F. Sécurité des crypto-systèmes de McEliece. Mémoire de DEA, École polytechnique, 1993.
Chao, J., Tanada, K., and Tsujii, S. Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks. In Advances in Cryptology — CRYPTO’ 94 (1994), Y. Desmedt, Ed., vol. 839 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 50–55. Proc. 14th Annual International Cryptology Conference, Santa Barbara, Ca, USA, August 21–25.
Charlap, L. S., Coley, R., and Robbins, D. P. Enumeration of rational points on elliptic curves over finite fields. Draft, 1991.
Couveignes, J.-M.Quelques calculs en théorie des nombres. Thèse, Université de Bordeaux I, July 1994.
Couveignes, J.-M., and Morain, F. Schoof’s algorithm and isogeny cycles. In preparation, February 1995. Preliminary version appeared in ANTS-I (1994), L. Adleman and M.-D. Huang, Eds., vol. 877 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 43–58. 1st Algorithmic Number Theory Symposium-Cornell University, May 6–9, 1994.
Demytko, N. A new elliptic curve based analogue of RSA. In Advances in Cryptology — EUROCRYPT’ 93 (1994), T. Helleseth, Ed., vol. 765 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 40–49. Workshop on the Theory and Application of Cryptographic Techniques, Lofthus, Norway, May 23–27, 1993.
Dewaghe, L. Remarques sur l’algorithme SEA. In preparation, Dec. 1994.
Elkies, N. D. Explicit isogenies. Draft, 1991.
Goldwasser, S., and Kilian, J. Almost all primes can be quickly certified. In Proc. 18th STOC (1986), ACM, pp. 316–329. May 28–30, Berkeley.
Harper, G., Menezes, A., and Vanstone, S. Public-key cryptosystems with very small key length. In Advances in Cryptology — EUROCRYPT’ 92 (1993), R. A. Rueppel, Ed., vol. 658 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 163–173. Workshop on the Theory and Application of Cryptographic Techniques, Balatonfüred, Hungary, May 24–28, 1992, Proceedings.
Hervé, J.-C., Serpette, B., and Vuillemin, J. BigNum: A portable and efficient package for arbitrary-precision arithmetic. Tech. Rep. 2, Digital Paris Research Laboratory, May 1989.
Kaliski, Jr., B. S. A pseudo-random bit generator based on elliptic logarithms. In Proc. Crypto 86 (1986), vol. 263 of Lecture Notes in Comput. Sci. Proceedings Crypto’ 86, Santa Barbara (USA), August 11–15, 1986.
Kaliski, Jr., B. S. One-way permutations on elliptic curves. Journal of Cryptology 3,3 (1990), 187–199.
Knuth, D. E.The Art of Computer Programming: Seminumerical Algorithms. Addison-Wesley, 1981.
Koblitz, N. Elliptic curve cryptosystems. Math. Comp. 48,177 (Jan. 1987), 203–209.
Koblitz, N. Elliptic curve implementation of zero-knowledge blobs. Journal of Cryptology 4,3 (1991), 207–213.
Koyama, K., Maurer, U. M., Okamoto, T., and Vanstone, S. A. New publickey schemes based on elliptic curves over the ring Zn. In Advances in Cryptology (1991), vol. 576 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 252–266. Proc. Crypto’ 91, Santa Barbara, August 12–15.
Lay, G.-J., and Zimmer, H. G. Constructing elliptic curves with given group order over large finite fields. In ANTS-I (1994), L. Adleman and M.-D. Huang, Eds., vol. 877 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 250–263. 1st Algorithmic Number Theory Symposium — Cornell University, May 6–9, 1994.
Lehmann, F., Maurer, M., Müller, V., and Shoup, V. Counting the number of points on elliptic curves over finite fields of characteristic greater than three. In ANTS-I (1994), L. Adleman and M.-D. Huang, Eds., vol. 877 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 60–70. 1st Algorithmic Number Theory Symposium — Cornell University, May 6–9, 1994.
Lenstra, Jr., H. W. Factoring integers with elliptic curves. Annals of Math. 126 (1987), 649–673.
Lercier, R., and Morain, F. Counting the number of points on elliptic curves over finite fields of characteristic 2. In preparation, Oct. 1994.
Massey, J. L. Shift-register and BCH decoding. IEEE Trans. on Information Theory IT-15, 1 (Jan. 1969), 122–127.
Menezes, A., Okamoto, T., and Vanstone, S. A. Reducing elliptic curves logarithms to logarithms in a finite field. In Proceedings 23rd Annual ACM Symposium on Theory of Computing (STOC) (1991), ACM Press, pp. 80–89. May 6–8, New Orleans, Louisiana.
Menezes, A., and Vanstone, S. A. The implementation of elliptic curve cryptosystems. In Advances in Cryptology (1990), J. Seberry and J. Pieprzyk, Eds., no. 453 in Lecture Notes in Comput. Sci., Springer-Verlag, pp. 2–13. Proceedings Auscrypt’ 90, Sysdney (Australia), January 1990.
Menezes, A. J.Elliptic curve public key cryptosystems. Kluwer Academic Publishers, 1993.
Menezes, A. J., Vanstone, S. A., and Zuccherato, R. J. Counting points on elliptic curves over F2m. Math. Comp. 60,201 (Jan. 1993), 407–420.
Miller, V. Use of elliptic curves in cryptography. In Advances in Cryptology (1987), A. M. Odlyzko, Ed., vol. 263 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 417–426. Proceedings Crypto’ 86, Sauta Barbara (USA), August 11–15, 1986.
Miyaji, A. On ordinary elliptic curve cryptosystems. In Advances in Cryptology — ASIACRYPT’ 91 (1991), vol. 739 of Lecture Notes in Comput. Sci., Springer-Verlag,pp. 50–55.
Miyaji, A. Elliptic curves over Fp suitable for cryptosystems. In Advances incryptology — AUSCRYPT’ 92 (1993), J. Seberry and Y. Zheng, Eds., vol. 718 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 479–491. Workshop on the theory and application of cryptographic techniques, Gold Coast, Queensland, Australia, December 13–16, 1992.
Montgomery, P. L. Speeding the Pollard and elliptic curve methods of factorization. Math. Comp. 48,177 (Jan. 1987), 243–264.
Montgomery, P. L.An FFT extension of the Elliptic Curve Method of factorization. PhD thesis, University of California — Los Angeles, 1992.
Morain, F. Building cyclic elliptic curves modulo large primes. In Advances in Cryptology — EUROCRYPT’ 91 (1991), D. Davies, Ed., vol. 547 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 328–336. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques, Brighton, United Kingdom, April 8–11, 1991.
Morain, F. Implantation de l’algorithme de Schoof-Elkies-Atkin. Preprint, January,1994.
Morain, F. Calcul du nombre de points sur une courbe elliptique dans un corps fini: aspects algorithmiques. To appear in the Actes des Journées Arithmétiques 1993, Feb. 1995.
Müller, V. Looking for the eigenvalue in Schoof’s algorithm. In preparation, Oct. 1994.
Okamoto, T., Fujikoda, A., and Fujisaki, E. An efficient digital signature scheme based on an elliptic curve over the ring Zn. In Advances in Cryptology — CRYPTO’ 92 (1992), vol. 740 of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 54–65.
Schoof, R. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp. 44 (1985), 483–494.
Schoof, R. Counting points on elliptic curves over finite fields. To appear in Proc. Journées Arithmétiques 93, Jan. 1995.
Shoup, V. A new polynomial factorization algorithm and its implementation. Preprint, 1994.
Silverman, J. H.The arithmetic of elliptic curves, vol. 106 of Graduate Texts in Mathematics. Springer, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lercier, R., Morain, F. (1995). Counting the number of points on elliptic curves over finite fields: strategies and performances. In: Guillou, L.C., Quisquater, JJ. (eds) Advances in Cryptology — EUROCRYPT ’95. EUROCRYPT 1995. Lecture Notes in Computer Science, vol 921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49264-X_7
Download citation
DOI: https://doi.org/10.1007/3-540-49264-X_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59409-3
Online ISBN: 978-3-540-49264-1
eBook Packages: Springer Book Archive