Universal exponentiation algorithm a first step towards provable SPA-resistance

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

Volumn 2162, Issue , 2001, Pages 300-308

  Clavier, Christophe ^a   Marc, Marc Joye ^a  

^a GEMPLUS   (France)

Author keywords

Addition chains; Discrete logarithm; Exponentiation; Implementation; Provable security; Rsa cryptosystem; Side channel attacks; Simple power analysis (SPA); Smart cards

Indexed keywords

EMBEDDED SYSTEMS; SMART CARDS;

ADDITION CHAINS; DISCRETE LOGARITHMS; EXPONENTIATIONS; IMPLEMENTATION; PROVABLE SECURITY; RSA CRYPTOSYSTEMS; SIMPLE POWER ANALYSIS;

SIDE CHANNEL ATTACK;

EID: 84944905303     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44709-1_25     Document Type: Conference Paper

References (13)

1. Mihir Bellare, Anand Desai, David Pointcheval, and Phillip Rogaway. Relations among notions of security for public-key encryption schemes. Full paper (30 pages), February 1999. An extended Abstract appears in H. Krawczyk, ed., Advances in Cryptology-CRYPTO’98, volume 1462 of Lecture Notes in Computer Science, pages 26-45, Springer-Verlag, 1998.
2. Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security, pages 62-73. ACM Press, 1993.
3. Mihir Bellare and Phillip Rogaway. Optimal asymmetric encryption. In A. De Santis, editor, Advances in Cryptology-EUROCRYPT’94, volume 950 of Lecture Notes in Computer Science, pages 92-111. Springer-Verlag, 1995.
4. F. Bergeron, J. Berstel, S. Brlek, and C. Duboc. Addition chains using continued fractions. Journal of Algorithms, 10(3):403-412, September 1989.
5. Suresh Chari, Charanjit S. Jutla, Josyula R. Rao, and Pankaj Rohatgi. Towards sound approaches to counteract power-analysis attacks. In M. Wiener, editor, Advances in Cryptology-CRYPTO’99, volume 1666 of Lecture Notes in Computer Science, pages 398-412. Springer-Verlag, 1999.
6. Oded Goldreich. On the foundations of modern cryptography. In B. Kaliski, editor, Advances in Cryptology-CRYPTO’97, volume 1294 of Lecture Notes in Computer Science, pages 46-74. Springer-Verlag, 1997.
7. Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
8. Donald E. Knuth. The art of computer programming/Seminumerical algorithms, volume 2. Addison-Wesley, 2nd edition, 1981.
9. Paul Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In N. Koblitz, editor, Advances in Cryptology-CRYPTO’96, volume 1109 of Lecture Notes in Computer Science, pages 104-113. Springer-Verlag, 1996.
10. Paul Kocher. Secure modular exponentiation with leak minimization for smart cards and other cryptosystems. International patent WO 99/67909, March 1998.
11. Paul Kocher, Joshua Jaffe, and Benjamin Jun. Differential power analysis. In M. Wiener, editor, Advances in Cryptology-CRYPTO’99, volume 1666 of Lecture Notes in Computer Science, pages 388-397. Springer-Verlag, 1999.
12. Colin D. Walter. Exponentiation using division chains. IEEE Transactions on Computers, 47(7):757-765, July 1998.
13. Yacov Yacobi. Exponentiating faster with addition chains. In Advances in Cryptology-EUROCRYPT’90, volume 473 of Lecture Notes in Computer Science, pages 222-229. Springer-Verlag, 1991.