Elliptic Curve Cryptosystems
As we have seen in Section 6.1, the elements of a finite cyclic group G may be used to implement several cryptographic schemes, provided that finding logarithms of elements in G is infeasible. We may take G to be a cyclic subgroup of E(F q ), the group of F q -rational points of an elliptic curve defined over F q ; this was first suggested by N. Koblitz  and V. Miller . Since the addition in this group is relatively simple, and moreover the discrete logarithm problem in G is believed to be intractable, elliptic curve cryptosystems have the potential to provide security equivalent to that of existing public key schemes, but with shorter key lengths. Having short key lengths is a factor that can be crucial in some applications, for example the design of smart card systems.
KeywordsElliptic Curve Elliptic Curf Logarithm Problem Discrete Logarithm Discrete Logarithm Problem
Unable to display preview. Download preview PDF.
- G. Agnew, T. Beth, R. Mullin and S. Vanstone, Arithmetic operations in GF(2 m ), J. of Cryptology, to appear.Google Scholar
- M. Ben-Or, “Probabilistic algorithms in finite fields”, 22nd Annual Symposium on Foundations of Computer Science (1981), 394–398.Google Scholar
- B. Kaliski, Elliptic Curves and Cryptography: A PseudorAndom Bit Generator and other Tools, Ph.D. thesis, M.I.T., January 1988.Google Scholar
- N. Koblitz, “Constructing elliptic curve cryptosystems in characteristic 2”, Advances in Cryptology: Proceedings of Crypto ’90, Lecture Notes in Computer Science, 537 (1991), Springer-Verlag, 156–167.Google Scholar
- N. Koblitz, “Cm-Curves with good cryptographic properties”, Advances in Cryptology: Proceedings of Crypto ’91, Lecture Notes in Computer Science, 576 (1992), Springer-Verlag, 279–287.Google Scholar
- A. Lenstra, H.W. Lenstra, M. Manasse and J. Pollard, “The number field sieve” , Proceedings of the 22nd Annual Acm Symposium on Theory of Computing (1990), 564–572.Google Scholar
- A. Menezes, T. Okamoto and S. Vanstone, “Reducing elliptic curve logarithms to logarithms in a finite field”, Proceedings of the 23rd Annual Acm Symposium on Theory of Computing (1991), 80–89.Google Scholar
- A. Menezes, S. Vanstone and R. Zuccherato, “Counting points on elliptic curves over F2m”, Math. Comp., to appear.Google Scholar
- V. Miller, “Uses of elliptic curves in cryptography”, Advances in Cryptology: Proceedings of Crypto ’85, Lecture Notes in Computer Science, 218 (1986), Springer-Verlag, 417–426.Google Scholar
- V. Miller, “Short programs for functions on curves”, unpublished manuscript, 1986.Google Scholar
- A. Odlyzko, “Discrete logarithms and their cryptographic significance”, in Advances in Cryptology: Proceedings of Eurocrypt ’84, Lecture Notes in Computer Science, 209 (1985), Springer-Verlag, 224–314.Google Scholar
- C. Pomerance, “Fast, rigorous factorization and discrete logarithms al-gorithms”, in Discrete Algorithms and Complexity, Academic Press, 1987, 119–143.Google Scholar