Fast multi-scalar multiplication methods on elliptic curves with precomputation strategy using montgomery trick

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

Volumn 2523, Issue , 2003, Pages 564-578

  Okeya, Katsuyuki ^a   Sakurai, Kouichi ^b  

^a HITACHI LTD   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

Elliptic curve cryptography; Montgomery trick; Multi scalar multiplication; Precomputation; Simultaneous

Indexed keywords

EMBEDDED SYSTEMS; GEOMETRY; HARDWARE; PUBLIC KEY CRYPTOGRAPHY;

ELLIPTIC CURVE CRYPTOGRAPHY; MONTGOMERY; MULTI-SCALAR MULTIPLICATIONS; PRE-COMPUTATION; SIMULTANEOUS;

CRYPTOGRAPHY;

EID: 35248883993     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36400-5_41     Document Type: Article

References (27)

1. [Aki01] Akishita, T., Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form, Eighth Annual Workshop on Selected Area in Cryptography (SAC2001), (2001).
2. [ANSI] ANSI X9.62, Public Key Cryptography for the Financial Services Industry, The Elliptic Curve Digital Signature Algorithm (ECDSA), (1998).
3. [BHLM01] Brown, M., Hankerson, D., López, J., Menezes, A., Software Implementation of the NIST Elliptic Curves over Prime Fields, Topics in Cryptology - CT-RSA 2001, LNCS2020, (2001), 250-265.
4. [BP98] Bailey, D.V., Paar, C., Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms, Advances in Cryptology - CRYPTO'98, LNCS1462, (1998), 472-485.
5. [BP99] Bailey, D.V., Paar, C., Inversion in Optimal Extension Fields, Conference on The Mathematics of Public Key Cryptography, (1999).
6. [BSS99] Blake, I.F., Seroussi, G., Smart, N.P., Elliptic Curves in Cryptography, Cambridge University Press,(1999).
7. [CC87] Chunnovsky, D., Chundovsky, G., Sequences of numbers generated by addition in formal groups and new primality and factoring tests, Advances in Applied Mathematics, 7 (1987), 385-434.
8. [CMO98] Cohen, H., Miyaji, A., Ono, T., Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, Advances in Cryptology - ASIACRYPT '98, LNCS1514, (1998), 51-65.
9. [Coh93] Cohen, H., A course in computational algebraic number theory, GTM138, Springer-Verlag, New York, (1993).
10. [DSA] National Institute of Standards and Technology (NIST), Digital Signature Standard (DSS), PIPS PUB 186-2, (2000).
11. [Elg85] ElGamal, T., A public-key cryptosystem and a signature scheme based on discrete logarithm, IEEE Transactions on Information Theory 31 (1985), 469-472.
12. [Eng99] Enge, A., Elliptic Curves and their applications to Cryptography, Kluwer Academic publishers,(1999).
13. [GLV01] Gallant, R.P., Lambert, R.J., Vanstone, S.A., Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms, Advances in Cryptology - CRYPTO 2001, LNCS2139, (2001), 190-200.
14. [HHM00] Hankerson, D., Hernandez, J.L., Menezes, A., Software Implementation of Elliptic Curve Cryptography over Binary Fields, Cryptographic Hardware and Embedded Systems (CHES2000), LNCS1965, (2000), 1-24.
15. [Kob87] Koblitz, N-, Elliptic curve cryptosystems, Math. Comp. 48, (1987), 203-209.
16. [Knu81] Knuth, D.E., The Art of Computer Programming, 2 - Semi-numerical Algorithms, Addison-Wesley, 2nd edition, (1981).
17. [IEEEp1363] IEEE P1363 Standard Specifications for Public Key Cryptography (1999). Available at http://grouper.ieee.org/groups/1363/
18. m), Proc. PKC'00 LNCS1751, (2000), 405-421.
19. [LL94] Lim, C.H., Lee, P.J., More Flexible Exponentiation with Precomputation, Advances in Cryptology - CRYPTO '94, LNCS839, (1994), 95-107.
20. [Men93] Menezes, A.J., Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, (1993).
21. [Mil86] Miller, V.S., Use of elliptic curves in cryptography, Advances in Cryptology - CRYPTO '85, LNCS218,(1986), 417-426.
22. [MO90] Morain, F., Olivos, J., Speeding up the computations on an elliptic curve using addition-subtraction chains, Theoretical Informatics and Applications 24 No.6, (1990), 531-544.
23. [Möl01] Möller, B., Algorithm for multi-exponentiation, Eighth Annual Workshop on Selected Area in Cryptography (SAC2001), (2001), 179-194.
24. [Mon87] Montgomery, P.L., Speeding the Pollard and Elliptic Curve Methods of Factorizations, Math. Comp. 48, (1987), 243-264
25. [RSA78] Rivest, R.L., Shamir, A., Adleman, L., A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, Vol.21, No.2, (1978), 120-126.
26. [SEC-1] Standards for Efficient Cryptography, Elliptic Curve Cryptography Ver. 1.0, (2000), Available at http://www:secg.org/secg.docs.htm
27. [Sil86] Silverman, J.H., The Arithmetic of Elliptic Curves, GMT106, Springer-Verlag, New York, (1986).