Efficient scalar multiplications on elliptic curves with direct computations of several doublings

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E84-A, Issue 1, 2001, Pages 120-129

  Sakai, Yasuyuki ^a   Sakurai, Kouichi ^a  

^a MITSUBISHI ELECTRIC CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; NETWORK PROTOCOLS;

ELLIPTIC CURVE CRYPTOSYSTEMS; SCALAR MULTIPLICATIONS; WINDOW METHOD;

CRYPTOGRAPHY;

EID: 0035126332     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. D.V. Chudnovsky and G.V. Chudnovsky, "Sequences of numbers generated by addition in formal groups and new primality and factorization tests," Advances in Applied Math., vol.7, pp.385-434, 1986.
2. H. Cohen, A. Miyaji, and T. Ono, "Efficient elliptic curve exponentiation using mixed coordinates," Advances in Cryptology-ASIACRYPT'98, LNCS, vol.1514, pp.51-65, Springer-Verlag, 1998.
3. D.M. Gordon, "A survey of fast exponentiation methods," J. Algorithms, vol.27, pp.129-146, 1998.
4. J. Guajardo and C. Paar, "Efficient algorithms for elliptic curve cryptosystems," Advances in CryptologyCRYPTO'97, LNCS, vol.1294, pp.342-356, SpringerVerlag, 1997.
5. Y. Han and P.C. Tan, "Direct computation for elliptic curve cryptosystems," Pre-proc. CHES'99, pp.328-340, SpringerVerlag, 1999.
6. IEEE P13G3/D11 (Draft Version 11), 1999. http://grouper.ieee.org/groups/1363/
7. K. Itoh, M. Takenaka, N. Torii, S. Temma, and Y. Kurihara, "Fast implementation of public-key cryptography on a DSP TMS320C6201," Cryptography Hardware and Embedded Systems, LNCS, vol.1717, pp.Cl-72, Springer-Verlag, 1999.
8. N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, vol.48, pp.203-209, 1987.
9. K. Koyama and Y. Tsuruoka, "Speeding up elliptic cryptosystems by using a signed binary window method," Advances in Cryptology-CRYPTO'92, LNCS, vol.740, pp.345-357, Springer-Verlag, 1993.
10. D.H. Lehmer, "Euclid's algorithm for large numbers," American Mathematical Monthly, vol.45, pp.227-233, 1938.
11. V. Miller, "Uses of elliptic curves in cryptography," Advances in Cryptology-CRYPTO'85, LNCS, vol.218, pp.417-426, Springer-Verlag, 1986.
12. A. Miyaji, T. Ono, and H. Cohen, "Efficient elliptic curve exponentiation (I)," IEICE Technical Report, ISEC97-16, 1997.
13. A. Miyaji, T. Ono, and H. Cohen, "Efficient elliptic curve exponentiation," Advances in Cryptology-ICICS'97, LNCS, vol.1334, pp.282-290, Springer-Verlag, 1997.
14. V. Müller, "Efficient algorithms for multiplication on elliptic curves," Proc. GI-Arbeitskonferenz Chipkarten 1998, TU München, 1998.
15. NIST, "Recommended elliptic curves for federal government use," http://csrc.nist.gov/encryption/,1999.
16. J.A. Solinas, "An improved algorithm for arithmetic on a family of elliptic curves," Advances in CryptologyCRYPTO'97, LNCS, vol.1294, pp.357-371, SpringerVerlag, 1997.
17. E. De Win, S. Mister, B. Preneel, and M. Wiener, "On the performance of signature schemes based on elliptic curves," Algorithmic Number Theory III, LNCS, vol.1423, pp.252266, Springer-Verlag, 1998.