The width-w NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks

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

Volumn 2612, Issue , 2003, Pages 328-342

  Okeya, Katsuyuki ^a   Takagi, Tsuyoshi ^b  

^a HITACHI LTD   (Japan)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Elliptic curve cryptosystem; Memory constraint; Pre computation table; Side channel attacks; Smart card; Width w NAF

Indexed keywords

CHAINS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ECONOMIC AND SOCIAL EFFECTS; EFFICIENCY; SMART CARDS;

COMPUTATIONAL RESOURCES; CRYPTOGRAPHIC ALGORITHMS; ELLIPTIC CURVE CRYPTOSYSTEM; ELLIPTIC SCALAR MULTIPLICATION; MEMORY CONSTRAINTS; PRE-COMPUTATION; SCALAR MULTIPLICATION; WIDTH-W NAF;

SIDE CHANNEL ATTACK;

EID: 35248865717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36563-x_23     Document Type: Article

References (38)

1. ANSI X9.62, Public Key Cryptography for the Financial Services Industry, The Elliptic Curve Digital Signature Algorithm (ECDSA), (1999).
2. Brier, É., Joye, M., Weierstrass Elliptic Curves and Side-Channel Attacks, Public Key Cryptography (PKC2002), LNCS2274, (2002), 335-345.
3. I. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography, Cambridge University Press, 1999.
4. Cohen, H., Miyaji, A., Ono, T., Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, Advances in Cryptology - ASIACRYPT '98, LNCS1514, (1998), 51-65.
5. Coron, J. S., Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems, Cryptographic Hardware and Embedded Systems (CHES'99), LNCS1717, (1999), 292-302.
6. National Bureau of Standards, Data Encryption Standard, Federal Information Processing Standards Publication 46 (FIPS PUB 46), (1977).
7. p hedged against Non-Differential Side-Channel Attacks, International Association for Cryptologic Research (IACR), Cryptology ePrint Archive 2002/007, (2002). Available at http://eprint.iacr.org/
8. Hitchcock, Y., Montague, P., A New Elliptic Curve Scalar Multiplication Algorithm to Resist Simple Power Analysis, Information Security and Privacy, 7th Australasian Conference, (ACISP 2002), LNCS2384, (2002), 214-225.
9. Itoh, K., Izu, T., and Takenaka, M., Address-bit Differential Power Analysis on Cryptographic Schemes OK-ECDH and OK-ECDSA, to appear in Workshop on Cryptographic Hardware and Embedded Systems 2002 (CHES 2002), 2002.
10. Itoh, K., Yajima, J., Takenaka, M., and Torii, N., DPA Countermeasures by improving the Window Method, to appear in Workshop on Cryptographic Hardware and Embedded Systems 2002 (CHES 2002), 2002.
11. IEEE P1363, Standard Specifications for Public-Key Cryptography, http://groupe.ieee.org/groups/1363/
12. Izu, T., Takagi, T., A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks, Public Key Cryptography (PKC2002), LNCS2274, (2002), 280-296.
13. Joye, M., Quisquater, J. J., Hessian elliptic curves and side-channel attacks, Cryptographic Hardware and Embedded Systems (CHES'01), LNCS2162, (2001), 402-410.
14. Joye, M., Tymen, C., Compact Encoding of Non-adjacent Forms with Applications to Elliptic Curve Cryptography, Public Key Cryptography 2001 (PKC2001), pp.353-364, LNCS 1992, 2001.
15. Joye, M., Tymen, C., Protections against differential analysis for elliptic curve cryptography: An algebraic approach, Cryptographic Hardware and Embedded Systems (CHES'01), LNCS2162, (2001), 377-390.
16. Koblitz, N., Elliptic curve cryptosystems, Math. Comp. 48, (1987), 203-209.
17. Kocher, C., Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems, Advances in Cryptology - CRYPTO '96, LNCS1109, (1996), 104-113.
18. Kocher, C., Jaffe, J., Jun, B., Differential Power Analysis, Advances in Cryptology - CRYPTO '99, LNCS1666, (1999), 388-397.
19. K. Koyama and Y. Tsuruoka, Speeding Up Elliptic Curve Cryptosystems using a Signed Binary Windows Method, Advances in Cryptology - CRYPTO '92, LNCS740, (1992), pp.345-357.
20. Liardet, P. Y., Smart, N. P., Preventing SPA/DPA in ECC systems using the Jacobi form, Cryptographic Hardware and Embedded System (CHES'01), LNCS2162, (2001), 391-401.
21. Miller, V. S., Use of elliptic curves in cryptography, Advances in Cryptology - CRYPTO '85, LNCS218,(1986), pp.417-426.
22. Atsuko Miyaji, Takatoshi Ono, Henri Cohen, Efficient elliptic curve exponentiation, Information and Communication Security (ICICS 1997), (1997), pp.282-291.
23. Möller, B., Securing Elliptic Curve Point Multiplication against Side-Channel Attacks, Information Security (ISC2001), LNCS2200, (2001), 324-334.
24. Möller, B., Securing elliptic curve point multiplication against side-channel attacks, addendum: Efficiency improvement, http://www.informatik.tu-darmstadt.de/TI/Mitarbeiter/moeller/ecc-scaisc01.pdf, (2001).
25. Möller, B., Parallelizable Elliptic Curve Point Multiplication Method with Resistance against Side-Channel Attacks, Information Security Conference (ISC 2002), LNCS 2433, (2002), 402-413.
26. National Institute of Standards and Technology, FIPS 186-2, http://csrc.nist.gov/publication/fips/fips186-2/fips186-2.pdf
27. Oswald, E., Aigner, M., Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks, Cryptographic Hardware and Embedded Systems (CHES'01), LNCS2162, (2001), 39-50.
28. Okeya, K., Miyazaki, K., Sakurai, K., A Fast Scalar Multiplication Method with Randomized Projective Coordinates on a Montgomery-form Elliptic Curve Secure against Side Channel Attacks, The 4th International Conference on Information Security and Cryptology (ICISC 2001), LNCS2288, (2002), 428-439.
29. Okeya, K., Sakurai, K., Power Analysis Breaks Elliptic Curve Cryptosystems even Secure against the Timing Attack, Progress in Cryptology - INDOCRYPT 2000, LNCS1977, (2000), 178-190.
30. Okeya, K., Sakurai, K., On Insecurity of the Side Channel Attack Countermeasure using Addition-Subtraction Chains under Distinguishability between Addition and Doubling, The 7th Australasian Conference in Information Security and Privacy, (ACISP 2002), LNCS2384, (2002), 420-435.
31. Okeya, K., Sakurai, K., Fast Multi-Scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy using Montgomery Trick, Cryptographic Hardware and Embedded System (CHES 2002), Pre-Proceedings, (2002), 566-581.
32. Okeya, K., Sakurai, K., A Second-Order DPA Attack Breaks a Window-method based Countermeasure against Side Channel Attacks, Information Security Conference (ISC 2002), LNCS 2433, (2002), 389-401.
33. Oswald, E., Enhancing Simple Power-Analysis Attacks on Elliptic Curve Cryptosystems, to appear in Workshop on Cryptographic Hardware and Embedded Systems 2002 (CHES 2002), 2002.
34. 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.
35. Standards for Efficient Cryptography Group (SECG), http://www.secg.org
36. Solinas, J. A., Efficient Arithmetic on Koblitz Curves, Design, Codes and Cryptography, 19, (2000), 195-249.
37. Walter, C. D., Some Security Aspects of the Mist Randomized Exponentiation Algorithm, to appear in Workshop on Cryptographic Hardware and Embedded Systems 2002 (CHES 2002), 2002.
38. Walter, C. D., Breaking the Liardet-Smart Randomized Exponentiation Algorithm, to apper in CARDIS'02.