A combined timing and power attack

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

Volumn 2274, Issue , 2002, Pages 263-279

  Schindler, Werner ^a  

^a Federal Office for Information Security   (Germany)

Author keywords

Mon tgomery s algorithm; P ower attack; Timing attack

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

MODULAR EXPONENTIATIONS; MONTGOMERY; MULTIPLICATION ALGORITHMS; POWER ATTACKS; S-ALGORITHMS; SAMPLE SIZES; SECRET EXPONENTS; SPECIFIC INFORMATION;

SIDE CHANNEL ATTACK;

EID: 84958960266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45664-3_19     Document Type: Conference Paper

References (9)

1. J.-F. Dhem, F. Koeune, P.-A. Leroux, P.-A. Mestré, J.-J. Quisquater, J.-L. Willems: A Practical Implementation of the Timing Attack. In: J.-J. Quisquater and B. Schneier (eds.): Smart Card – Research and Applications. Lecture Notes in Computer Science 1820,Berlin,Springer (2000),175–191.
2. P. Kocher: Timing Attacks on Implementations of Diffie-Hellman,RSA,DSS and Other Systems. In: N. Koblitz (ed.): Advances in Cryptology – Crypto’96,Lecture Notes in Computer Science 1109. Springer,Heidelb erg (1996),104–113.
3. K. Gandolfi, C. Mourtel, F. Olivier: Electromagnetic Analysis: Concrete Results. In: Ç.K. Koç,D. Naccache,C. Paar (eds.): Cryptographic Hardware and Embedded Systems — CHES 2001,Springer,Lecture Notes in Computer Science 2162,Berlin (2001),251–261.
4. P. Kocher, J. Jaffe, B. Jub: Differential Power Analysis. In: M. Wiener (ed.): Advances in Cryptology – Crypto’99. Lecture Notes in Computer Science 1666, Berlin,Springer (1999),388–397.
5. A.J. Menezes, P.C. van Oorschot, S.C. Vanstone: Handbook of Applied Cryptography, Bo ca Raton,CR C Press (1997).
6. P.L. Montgomery: Modular Multiplication without Trial Division, Math. Comp. 44,no. 170,519–521 (April 1985).
7. W. Schindler: Optimized Timing Attacks against Public Key Cryptosystems. To appear in Statistics & Decisions.
8. W. Schindler: A Timing Attack against RSA with the Chinese Remainder Theorem. In: Ç.K. Koç,C. Paar (eds.): Cryptographic Hardware and Embedded Systems — CHES 2000,Springer,Lecture Notes in Computer Science 1965,Berlin (2000),110–125.
9. C.D. Walter, S. Thompson: Distinguishing Exponent Digits by Observing Modular Subtractions. In: D. Naccache (ed.): Topics in Cryptology – CT-RSA 2001, Springer,Lecture Notes in Computer Science 2020,Berlin (2000),192–207.