Elliptic curve cryptosystem

Fujitsu Scientific and Technical Journal

Volumn 36, Issue 2, 2000, Pages 140-146

  Torii, Naoya ^a,b   Yokoyama, Kazuhiro ^b,c,d  

^a OSAKA UNIVERSITY   (Japan)

^b FUJITSU LABORATORIES LTD   (Japan)

^c UNIVERSITY OF TOKYO   (Japan)

^d KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER HARDWARE; DIGITAL SIGNAL PROCESSING; ELECTRONIC COMMERCE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; INFORMATION TECHNOLOGY; NETWORK PROTOCOLS; SEARCH ENGINES; SECURITY OF DATA; SOFTWARE ENGINEERING;

DIGITAL SIGNATURE ALGORITHM; ELECTRONIC INFORMATION SERVICES; ELLIPTIC CURVE CRYPTOSYSTEMS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0034462158     PISSN: 00162523     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. R. L. Rivest, A. Shamir, and L. M. Adleman: A method for obtaining digital signatures and public-key cryptosystems. Commu. ACM, 21, pp.120-126 (1978).
2. T. ElGamal: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Info. Theory, 31, pp.469-472 (1985).
3. N. Koblitz: Elliptic curve cryptosystems. Math. Comp., 48, pp.203-209 (1987).
4. V. S. Miller: Use of elliptic curves in cryptography. Advances in Cryptology - Crypto'85, Lecture Notes in Computer Science 218, pp.417-426, Springer-Verlag, 1986.
5. IEEE P1363/D13 (Draft Version 13) Standard Specifications for Public Key Cryptography. 1999. http://grouper.ieee.org/groups/1363/ index.html
6. S. C. Pohlig and M. E. Hellman: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. Info. Theory, 24, pp.106-110 (1978).
7. N. Koblitz: A Course in Number Theory and Cryptography. Graduate Texts in Mathematics, (2nd edition), 114, pp.102-103, Springer-Verlag, 1994.
8. A. J. Menezaes, T. Okamoto, and S. A. Vanstone: Reducing elliptic curve logarithms to a finite field. IEEE Trans. Info. Theory, 39, pp.1639-1646 (1993).
9. T. Satoh and K. Araki: Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curve. Comm. Math. Univ. Scncti, Pauli, 47, pp.81-92 (1998).
10. R. Schoof: Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp., 44, pp.483-494 (1998).
11. O. Atkin and F. Morain: Elliptic curves and primality proving. Math. Comp., 61, pp.29-68 (1993).
12. T. Izu, J. Kogure, M. Noro, and K. Yokoyama: Efficient implementation of Schoof's algorithm. Advances in Cryptology-ASIACRYPT'98, Lecture Notes in Computer Science, 1514, pp.66-79, Springer-Verlag, 1998.
13. T. Izu, J. Kogure, and K. Yokoyama: Efficient Implementation of Schoof's Algorithm in case of characteristic 2. PKC 2000, Lecture Notes in Computer Science, 1751, Springer-Verlag, pp.210-222, 2000.
14. M. Noro and T. Takeshima: Risa/Asir - a computer algebra system. Proceedings of IS-SAC'92, ACM Press, 387-396, 1992.
15. K. Ito, M.Takenaka, N. Torii, S. Temma, and Y. Kurihara: Fast implementation of public-key cryptography on a DSP TMS320C6201. First International Workshop, CHES'99, Lecture Notes in Computer Science 1717, pp.61-72, Springer-Verlag, 1999.
16. P. L. Montgomery: Modular Multiplication without Trial Division. Math. Comp., 44, pp.519-521 (1985).