Improved elliptic curve multiplication methods resistant against side channel attacks

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

Volumn 2551, Issue , 2002, Pages 296-313

  Izu, Tetsuya ^a   Möller, Bodo ^b   Takagi, Tsuyoshi ^b  

^a FUJITSU LABORATORIES LTD   (Japan)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Elliptic curve cryptosystems; Memory constraints; Scalar multiplication; Side channel attacks; Window method

Indexed keywords

GEOMETRY;

ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOSYSTEMS; IMPROVED SCHEME; MEMORY CONSTRAINTS; MULTIPLICATION ALGORITHMS; SCALAR MULTIPLICATION; SPECIAL CLASS; WINDOW METHODS;

SIDE CHANNEL ATTACK;

EID: 84974665915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36231-2_24     Document Type: Conference Paper

References (35)

1. ANSI X9.62-1998, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), 1998.
2. E. Brier and M. Joye, “Weierstraß Elliptic Curves and Side-Channel Attacks”, PKC 2002, LNCS 2274, pp. 335–345, Springer-Verlag, 2002.
3. C. Clavier and M. Joye, “Universal exponentiation algorithm–A first step towards provable SPA-resistance–”, CHES 2001, LNCS 2162, pp. 300–308, 2001.
4. H. Cohen, A. Miyaji and T. Ono, “Efficient elliptic curve exponentiation using mixed coordinates”, ASIACRYPT’98, LNCS 1514, pp. 51–65, 1998.
5. J. Coron, “Resistance against differential power analysis for elliptic curve cryptosystems”, CHES’99, LNCS 1717, pp. 292–302, 1999.
6. K. Itoh, et al. “Fast Implementation of Public-Key Cryptography on a DSP TMS320C6201”, CHES’99, LNCS 1717, pp. 61–72, 1999.
7. K. Itoh, J. Yajima, M. Takenaka, and N. Torii, “DPA Countermeasures by improving the Window Method”, to appear in CHES 2002, 2002
8. T. Izu and T. Takagi, “A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks”, PKC 2002, LNCS 2274, pp. 280–296, 2002.
9. T. Izu and T. Takagi, “A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks”, Technical Report CORR 2002-03, University of Waterloo, 2002. Available from http://www.cacr.math.uwaterloo.ca/.
10. T. Izu and T. Takagi, “On the Security of Brier-Joye’s Addition Formula for Weierstrass-form Elliptic Curves”, TR No. TI-3/02, Technische Universität Darmstadt, 2002. Available from http://www.informatik.tu-darmstadt.de/TI/.
11. M. Joye and J. Quisquater, “Hessian elliptic curves and side-channel attacks”, CHES 2001, LNCS 2162, pp. 402–410, 2001.
12. M. Joye and C. Tymen, “Protections against differential analysis for elliptic curve cryptography”, CHES 2001, LNCS 2162, pp. 377–390, 2001.
13. C. Kocher, “Timing Attackson Implementations of Diffie-Hellman, RSA, DSS, and Other Systems”, CRYPTO’96, LNCS 1109, pp. 104–113, 1996.
14. C. Kocher, J. Jaffe and B. Jun, “Differential power analysis”, CRYPTO’99, LNCS 1666, pp. 388–397, 1999.
15. P. Liardet and N. Smart, “Preventing SPA/DPA in ECC systems using the Jacobi form”, CHES 2001, LNCS 2162, pp. 391–401, 2001.
16. A. J. Menezes, P.C. van Oorschot, and S. A. Vanstone. Handbook of applied cryptography, CRC Press, 1997.
17. B. Möller, “Securing elliptic curve point multiplication against side-channel attacks”, ISC 2001, LNCS 2200. pp. 324-334, Springer-Verlag, 2001.
18. B. Möller, “Securing elliptic curve point multiplication against side-channel attacks”, Addendum: efficiency improvement, http://www.informatik.tu-darmstadt.de/TI/Mitarbeiter/moeller/ecc-sca-isc01.pdf, 2001.
19. B. Möller, “Parallelizable elliptic curve point multiplication method with resistance against side-channel attacks”, ISC 2002, LNCS 2433. pp. 402-413, 2002.
20. P. Montgomery, “Speeding the Pollard and elliptic curve methodsfor factorizations”, Math. Comp., vol. 48, pp. 243–264, 1987.
21. National Institute of Standards and Technology, Recommended Elliptic Curvesfor Federal Government Use, Appendix to FIPS 186-2, 2000.
22. E. Oswald, M. Aigner, “Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks”, CHES 2001, LNCS 2162, pp. 39-50, 2001.
23. H. Oguro and T. Kobayashi, “Efficient Window Method on Elliptic Curve Cryptosystems”, Proceedings of the 2002 Symposium on Cryptography and Information Security, SCIS 2002, pp. 687–692, 2002 (in Japanese).
24. K. Okeya, K. Miyazaki, and K. Sakurai, “A Fast Scalar Multiplication Method with Randomized Projective Coordinates on a Montgomery form Elliptic Curve Secure against Side Channel Attacks”, ICISC 2001, LNCS 2288, pp.428-439, Springer-Verlag, 2002.
25. K. Okeya and K. Sakurai, “Power analysis breaks elliptic curve cryptosystems even secure against the timing attack”, INDOCRYPT 2000, LNCS 1977, pp. 178–190, Springer-Verlag, 2000.
26. K. Okeya and K. Sakurai, “Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomery-form elliptic curve”, CHES 2001, LNCS 2162, pp. 126–141, Springer-Verlag, 2001.
27. K. Okeya, and K. Sakurai, “On Insecurity of the Side Channel Attack Countermeasure using Addition-Subtraction Chains under Distinguishability between Addition and Doubling”, ACISP 2002, LNCS 2384, pp. 420–435, 2002.
28. K. Okeya, and K. Sakurai, “A Second-Order DPA Attack Breaksa Windowmethod based Countermeasure against Side Channel Attacks”, ISC 2002, LNCS 2433, pp. 389–401, 2002.
29. W. Schindler, “A Combined Timing and Power Attack”, PKC 2002, LNCS 2274, pp. 263–279, Springer-Verlag, 2002.
30. M. Seysen, “DPA-Gegenmaßnahmen bei einer ECDSA-Implementierung auf Chipkarten”, presented at DPA Workshop, Bonn (BSI), ECC Brainpool, 2001.
31. Standards for Efficient Cryptography Group/Certicom Research, SEC 1: Elliptic Curve Cryptography, Version 1.0, 2000. Available from http://www.secg.org/.
32. Standardsf or Efficient Cryptography Group/Certicom Research, SEC 2: Recommended Elliptic Curve Cryptography Domain Parameters, Version 1.0, 2000.
33. K. Vedder and F. Weikmann, “Smart Cards–Requirements, Properties and Applications–”, Chipkarten, Vieweg, pp. 1-23, 1998.
34. C. D. Walter and S. Thompson, “Distinguishing Exponent Digits by Observing Modular Subtractions”, CT-RSA 2001, LNCS 2020, pp. 192–207, 2001.
35. C.D. Walter, “Breaking the Liardet-Smart Randomized Exponentiation Algorithm”, to appear in CARDIS’02.