Efficient scalar multiplications on elliptic curves without repeated doublings and their practical performance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1841, Issue , 2000, Pages 59-73

  Sakai, Yasuyuki ^a   Sakurai, Kouichi ^b  

^a MITSUBISHI ELECTRIC CORPORATION   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

Coordinate system; Elliptic curve cryptosystems; Implementation; Scalar multiplication; Window method

Indexed keywords

ALGORITHMS; SECURITY OF DATA;

CO-ORDINATE SYSTEM; ELLIPTIC CURVE CRYPTOSYSTEMS; IMPLEMENTATION; SCALAR MULTIPLICATION; WINDOW METHODS;

GEOMETRY;

EID: 23044517520     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10718964_6     Document Type: Conference Paper

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., 7 (1986), 385-434.
2. H. Cohen, A. Mlyaji and T. Ono, "Efficient Elliptic Curve Exponentiation Using Mixed Coordinates", Advances in Cryptology - ASIACRYPT'98, LNCS, 1514 (1998), Springer-Verlag, 51-65.
3. D. M. Gordon, "A survey of fast exponentiation methods", Journal of Algorithms, 27 (1998), 129-146.
4. J. Guajardo and C. Paar, "Efficient Algorithms for Elliptic Curve Cryptosystems", Advances in Cryptology – CRYPTO’97, LNCS, 1294 (1997), Springer-Verlag, 342-356.
5. Y. Han and P.C. Tan, "Direct Computation for Elliptic Curve Cryptosystems", Pre-proceedings of CHES'99, (1999), Springer-Verlag, 328-340.
6. IEEE P1363/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, 1717 (1999), Springer-Verlag,61-72.
8. N. Kößlitz, "Elliptic curve cryptosystems", Mathematics of Computation, 48 (1987), 203-209.
9. K. Koyama and Y. Tsuruoka, "Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method", Advances in Cryptology - CRYPTO'92, LNCS, 740 (1993), Springer-Verlag, 345-357.
10. D. H. Lehmer, "Euclid's Algorithm for Large Numbers", American Mathematical Monthly, 45 (1938), 227-233.
11. V. Miller, "Uses of elliptic curves in cryptography", Advances in Cryptology - CRYPTO'85, LNCS, 218 (1986), Springer-Verlag, 417-426.
12. A. Miyaji, T. Ono and H. Cohen, "Efficient Elliptic Curve Exponentiation (I)", Technical Report of IEICE, ISEC97-16, (1997)
13. A. Miyaji, T. Ono and H. Cohen, "Efficient Elliptic Curve Exponentiation", Advances in Cryptology - ICICS'97, LNCS, 1334 (1997), Springer-Verlag, 282-290.
14. V. MÜLLER, "Efficient Algorithms for Multiplication on Elliptic Curves", Proceedings of GI-Arbeitskonferenz Chipkarten 1998, TUMunchen, (1998)
15. NlST, "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 Cryptology - CRYPTO'97, LNCS, 1294 (1997), SpringerVerlag, 357-371.
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, 1423 (1998), Springer-Verlag, 252-266.