SPA resistant left-to-right integer recodings

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

Volumn 3897 LNCS, Issue , 2006, Pages 345-358

  Thériault, Nicolas ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; FORMABILITY; INTEGER PROGRAMMING;

BINARY FIELDS; DUMMY OPERATIONS; HYPERELLIPTIC CURVES;

CRYPTOGRAPHY;

EID: 33745590407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11693383_24     Document Type: Conference Paper

References (30)

1. D. Agrawal, B. Archambeault, J.R. Rao, and P. Rohatgi. The em side-channel(s). In B.S. Kaliski Jr., Ç.K. Koç, and C. Paar, editors, Cryptographic Hardware and Embedded Systems - CHES 2002, volume 2523 of LNCS, pages 29-45. Springer-Verlag, 2003.
2. R.M. Avanzi. A note on the signed sliding window integer recoding and a left-to-right analogue. In H. Handschuh and M.A. Hasan, editors, Selected Areas in Cryptography - SAC 2004, volume 3357 of LNCS, pages 130-143. Springer-Verlag, 2005.
3. R.M. Avanzi. Side channel attacks on implementations of curve-based cryptographic primitives. Cryptology ePrint Archive, Report 2005/017, 2005. Available at: 〈http://eprint.iacr.org/〉.
4. O. Billet and M. Joye. The jacobi model of an elliptic curve and side-channel analysis. In M. Fossorier, T. Høholdt, and A. Poli, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - AAECC-15, volume 2643 of LNCS, pages 34-42. Springer-Verlag, 2003.
5. É. Brier and M. Joye. Weierstraßelliptic curves and side-channel attacks. In D. Naccache and P. Paillier, editors, Public Key Cryptography - PKC 2002, volume 2274 of LNCS, pages 335-345. Springer-Verlag, 2002.
6. É. Brier, M. Joye, and I. Déchène. Unified point addition formulßfor elliptic curve cryptosystems. In N. Nedjah and L. de Macedo Mourelle, editors, Embedded Cryptographic Hardware: Methodologies & Architectures, Nova Science Publishers, 2004.
7. H. Cohen, A. Miyaji, and T. Ono. Efficient elliptic curve exponentiation. In ICICS'97, volume 1334 of LNCS, pages 282-290. Springer-Verlag, 1997.
8. H. Cohen, A. Miyaji, and T. Ono. Efficient elliptic curve exponentiation using mixed coordinates. In K. Ohta and D. Pei, editors, Advances in Cryptology - ASIACRYPT'98, volume 1514 of LNCS, pages 51-65. Springer-Verlag, 1998.
9. J.-S. Coron. Resistance against differential power analysis for elliptic curve cryptosystems. In Ç.K, Koç and C. Paar, editors, Cryptographic Hardware and Embedded Systems - CHES'99, volume 1717 of LNCS, pages 292-302. Springer-Verlag, 1999.
10. C. Guyot, K. Kaveh, and V. Patankar. Explicit algorithm for the arithmetic on the hyperelliptic jacobians of genus 3. J. Ramanujan Math. Soc., 19(2):75-115, 2004.
11. M. Joye and J.-J. Quisquater, Hessian elliptic curves and side-channel attacks. In Ç.K. Koç, D. Naccache, and C. Paar, editors, Cryptographic Hardware and Embedded Systems - CHES 2001, volume 2162 of LNCS, pages 402-410. Springer-Verlag, 2001.
12. M. Joye and S.-M. Yen. The montgomery powering ladder. In B.S. Kaliski Jr., Ç.K. Koç, and C. Paar, editors. Cryptographic Hardware and Embedded Systems - CHES 8002, volume 2523 of LNCS, pages 291-302. Springer-Verlag, 2003.
13. P. Kocher, J. Jaffe, and B. Jun. Differential power analysis. In M. Wiener, editor, Advances in Cryptology - CRYPTO'99, volume 1666 of LNCS, pages 388-397. Springer-Verlag, 1999.
14. T. Lange and M. Stevens. Efficient doubling on genus two curves over binary fields. In H. Handschuh and M.A. Hasan, editors, Selected Areas in Cryptography - SAC 2004, volume 3357 of LNCS, pages 170-181. Springer-Verlag, 2005.
15. P.-Y. Liardet and N.P. Smart. Preventing spa/dpa in ecc systems using the jacobi form. In Ç.K. Koç, D. Naccache, and C. Paar, editors, Cryptographic Hardware and Embedded Systems - CHES 2001, volume 2162 of LNCS, pages 391-401. Springer-Verlag, 2001.
16. C. H. Lim. A new method for securing elliptic scalar multiplication against side-channel attacks. In H. Wang, J. Pieprzyk, and V. Varadharajan, editors, Information Security and Privacy - ACISP 2004, volume 3108 of LNCS, pages 289-300. Springer-Verlag, 2004,
17. B. Möller. Securing elliptic curve point multiplication against side-channel attacks. In G.I. Davida and Y. Frankel, editors, Information Security: 4th International Conference - ISC 2001, volume 2200 of LNCS, pages 324-334. Springer-Verlag, 2001. Extended version available at: 〈http;//www.bmoeller.de/#ecc-sca〉.
18. J. Muir and D. Stinson. New minimal weight representations for left-to-right window methods. CACR Technical Report, CORR 2004-19, 2004. Available at: 〈http://www.cacr.math.uwaterloo.ea/techreports/2004/corr2004- 19.pdf〉.
19. K. Okeya, K. Schmidt-Samoa, C. Spahn, and T. Takagi. Signed binary representations revisited. In M. Franklin, editor, Advances in Cryptology - CRYPTO 2004, volume 3152 of LNCS, pages 123-139. Springer-Verlag, 2004.
20. K. Okeya and T. Takagi. The width-w naf method provides small memory and fast elliptic scalar multiplications secure against side channel attacks. In M. Joye, editor, Topics in Cryptology - CT-RSA 2003, volume 2612 of LNCS, pages 328-343. Springer-Verlag, 2003.
21. K. Okeya, T. Takagi, and C. Vuillaume. On the exact flexibility of the flexible countermeasure against side channel attacks. In H. Wang, J. Pieprzyk, and V. Varadharajan, editors, Information Security and Privacy - ACISP 2004, volume 3108 of LNCS, pages 466-477. Springer-Verlag, 2004.
22. J. Pelzl, T. Wollinger, J. Guajardo, and C. Paar. Hyperelliptic curve cryptosystems: Closing the performance gap to elliptic curves. In Cryptographic Hardware and Embedded Systems - CHES 2003, volume 2779 of LNCS, pages 351-365. Springer-Verlag, 2003.
23. J. Pelzl, T. Wollinger, and C. Paar. Low cost security: Explicit formulae for genus-4 hyperelliptic curves. In M. Matsui and R. Zuccherato, editors, Selected Areas in Cryptography - SAC 2003, volume 3006 of LNCS, pages 1-16. Springer-Verlag, 2004.
24. S.C. Pohlig and M.E. Hellman. An improved algorithm for computing logarithms over gf(p) and its cryptographic significance. IEEE Trans. Information Theory, 24(1):106-110, 1978.
25. G.W. Reitwiesner. Binary arithmetic. In Advances in computers, volume 1, pages 231-308. Academic Press, New York, 1960.
26. J.A. Solinas. An improved algorithm for arithmetic on a family of elliptic curves. In B.S. Kaliski Jr., editor, Advances in Cryptology - CRYPTO '97, volume 1294 of LNCS, pages 357-371. Springer-Verlag, 1997.
27. C.D. Walter. Simple power analysis of unified code for ecc double and add. In M. Joye and J.-J. Quisquater, editors, Cryptographic Hardware and Embedded Systems - CHES 2004, volume 3156 of LNCS, pages 191-204. Springer-Verlag, 2004.
28. A.C.C. Yao. On the evaluation of powers. SIAM J. Comput., 5(1):100-103, 1976.
29. S.-M. Yen and M. Joye. Checking before output may not be enough against fault-based cryptanalysis. IEEE Trans. on Computers, 49(9):967-970, Sept. 2000.
30. S.-M. Yen, S. Kim, S. Lim, and S. Moon. A countermeasure against one physical cryptanalysis may benefit another attack. In K. Kim, editor, Information Security and Cryptology - ICISC 2001, volume 2288 of LNCS, pages 414-427. Springer-Verlag, 2002.