Side channel attack on Ha-Moon's countermeasure of randomized signed scalar multiplication

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

Volumn 2904, Issue , 2003, Pages 334-348

  Okeya, Katsuyuki ^a   Han, Dong Guk ^b  

^a HITACHI LTD   (Japan)

^b Korea University   (South Korea)

Author keywords

DPA; Elliptic Curve Cryptosystem; Finite Markov Chain; Ha Moon's Countermeasure; Side Channel Attacks; SPA

Indexed keywords

CHAINS; CODES (SYMBOLS); CRYPTOGRAPHY; ELECTRONIC CRIME COUNTERMEASURES; GEOMETRY; MARKOV PROCESSES; MOON;

CRYPTOGRAPHIC OPERATIONS; DPA; ELLIPTIC CURVE CRYPTOSYSTEM; ELLIPTIC CURVE CRYPTOSYSTEMS; FINITE MARKOV CHAIN; SCALAR MULTIPLICATION; SIDE-CHANNEL INFORMATION; SPA;

SIDE CHANNEL ATTACK;

EID: 0348155940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24582-7_25     Document Type: Article

References (29)

1. Brier, É., Joye, M., Weierstrass Elliptic Curves and Side-Channel Attacks, Public Key Cryptography (PKC 2002), LNCS2274, (2002), 335-345.
2. Cohen, H., Miyaji, A., Ono, T., Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, Advances in Cryptology - ASIACRYPT '98, LNCS1514, (1998), 51-65.
3. Coron, J.S., Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems, Cryptographic Hardware and Embedded Systems (CHES '99), LNCS1717, (1999), 292-302.
4. Ebeid, N., Hasan, A., Analysis of DPA Countermeasures Based on Randomizing the Binary Algorithm, Technical Report of the University of Waterloo, No. CORR 2003-14. http://www.cacr.math.uwaterloo.ca/ techreports/2003/corr2003-14.ps
5. p hedged against Non-Differential Side-Channel Attacks, International Association for Cryptologic Research (IACR), Cryptology ePrint Archive 2002/007, (2002). http://eprint.iacr.org/2002/007/
6. Ha, J., and Moon, S., Randomized Signed-Scalar Multiplication of ECC to Resist Power Attacks, Workshop on Cryptographic Hardware and Embedded Systems 2002 (CHES 2002), LNCS 2523, (2002), 551-563.
7. Han, D.-G., Chang, N.S., Jung, S.W., Park, Y.-H., Kim, C.H., Ryu, H., Cryptanalysis of the Full version Randomized Addition-Subtraction Chains, The 8th Australasian Conference in Information Security and Privacy (ACISP 2003), LNCS2727, (2003), 67-78.
8. Itoh, K., Yajima, J., Takenaka, M., and Torii, N., DPA Countermeasures by improving the Window Method, Workshop on Cryptographic Hardware and Embedded Systems 2002 (CHES 2002), LNCS 2523, (2002), 318-332.
9. Izu, T., Takagi, T., A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks, Public Key Cryptography (PKC 2002), LNCS2274, (2002), 280-296.
10. Joye, M., Quisquater, J.J., Hessian elliptic curves and side-channel attacks, Cryptographic Hardware and Embedded Systems (CHES 2001), LNCS2162, (2001), 402-410.
11. Joye, M., Tymen, C., Protections against differential analysis for elliptic curve cryptography: An algebraic approach, Cryptographic Hardware and Embedded Systems (CHES 2001), LNCS2162, (2001), 377-390.
12. Koblitz, N., Elliptic curve cryptosystems, Math. Comp. 48, (1987), 203-209.
13. Kocher, C., Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems, Advances in Cryptology - CRYPTO '96, LNCS 1109, (1996), 104-113.
14. Kocher, C., Jaffe, J., Jun, B., Differential Power Analysis, Advances in Cryptology - CRYPTO '99, LNCS1666, (1999), 388-397.
15. Liardet, P.Y., Smart, N.P., Preventing SPA/DPA in ECC systems using the Jacobi form, Cryptographic Hardware and Embedded System (CHES 2001), LNCS2162, (2001), 391-401.
16. Miller, V.S., Use of elliptic curves in cryptography, Advances in Cryptology - CRYPTO '85, LNCS218, (1986), 417-426.
17. Möller, B., Securing Elliptic Curve Point Multiplication against Side-Channel Attacks, Information Security (ISC 2001), LNCS2200, (2001), 324-334.
18. Möller, B., Securing elliptic curve point multiplication against side-channel attacks, addendum: Efficiency improvement, http://www.informatik.tudarmstadt.de/TI/Mitarbeiter/moeller/ecc-scaisc01.pdf, (2001).
19. Oswald, E., Aigner, M., Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks, Cryptographic Hardware and Embedded Systems (CHES 2001), LNCS2162, (2001), 39-50.
20. 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.
21. 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.
22. 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.
23. Okeya, K., Sakurai, K., A Multiple Power Analysis Breaks the Advanced Version of the Randomized Addition-Subtraction Chains Countermeasure against Side Channel Attacks, in the proceedings of 2003 IEEE Information Theory Workshop (ITW 2003), (2003), 175-178.
24. Okeya, K., Takagi, T., The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks, Topics in Cryptology, The Cryptographers' Track at the RSA Conference 2003 (CT-RSA 2003), LNCS2612, (2003), 328-342.
25. Walter, C.D., MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis, Cryptographers' Track RSA conference (CT-RSA 2002), LNCS2271, (2002), 53-66.
26. Walter, C.D., Some Security Aspects of the Mist Randomized Exponentiation Algorithm, Workshop on Cryptographic Hardware and Embedded Systems 2002 (CHES 2002), LNCS 2523, (2002), 564-578.
27. Walter, C.D., Breaking the Liardet-Smart Randomized Exponentiation Algorithm, Proceedings of CARDIS'02, USENIX Assoc, (2002), 59-68.
28. Walter, C.D., Security Constraints on the Oswald-Aigner Exponentiation Algorithm, International Association for Cryptologic Research (IACR), Cryptology ePrint Archive 2003/013, (2003). http://eprint.iacr.org/2003/013/
29. Walter, C.D., Seeing through Mist Given a Small Fraction of an RSA Private Key, Topics in Cryptology, Topics in Cryptology, The Cryptographers' Track at the RSA Conference 2003 (CT-RSA 2003), LNCS2612, (2003), 391-402.