Elliptic curve cryptosystem

This paper describes elliptic curve cryptosystems (ECCs), which are expected to become the next-generation public key cryptosystems, and also describes Fujitsu Laboratories’ study of ECCs. ECCs require a shorter key length than RSA cryptosystems, which are the de facto standards of public key cryptosystems, but provide equivalent security levels. Because of the shorter key length, ECCs are fast and can be implemented with less hardware. First, we outline ECC and describe a typical digital signature algorithm. Then, we describe our technology for parameter generation of a secure ECC and the implementation of a fast ECC by software and by a digital signal processor. ECCs are expected to enter widespread use as a base technology of electronic information services.

[1]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[2]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[3]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[4]  Masayuki Noro,et al.  Risa/Asir—a computer algebra system , 1992, ISSAC '92.

[5]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[6]  Martin E. Hellman,et al.  An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[7]  Takakazu Satoh,et al.  Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves , 1998 .

[8]  Kazuhiro Yokoyama,et al.  Efficient Implementation of Schoof's Algorithm in Case of Characteristic 2 , 2000, Public Key Cryptography.

[9]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[10]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[11]  Alfred Menezes,et al.  Reducing elliptic curve logarithms to logarithms in a finite field , 1991, STOC '91.

[12]  N. Koblitz.  A Course in Number Theory and Cryptography , 1987 .

[13]  A. Atkin,et al.  ELLIPTIC CURVES AND PRIMALITY PROVING , 1993 .

[14]  R. Schoof.  Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .

[15]  Kazuhiro Yokoyama,et al.  Efficient Implementation of Schoof's Algorithm , 1998, ASIACRYPT.