A timing attack against RSA with the chinese remainder theorem

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

Volumn 1965, Issue , 2000, Pages 109-124

  Schindler, Werner ^a  

^a Federal Office for Information Security   (Germany)

Author keywords

Chinese remainder theorem; Montgomery multiplication; RSA; Timing attack

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; EMBEDDED SYSTEMS; HARDWARE;

CHINESE REMAINDER THEOREM; EXPONENTIATION ALGORITHMS; EXPONENTIATIONS; ITS EFFICIENCIES; MONTGOMERY MULTIPLICATION; MONTGOMERY'S ALGORITHM; RSA; SECRET EXPONENTS;

SIDE CHANNEL ATTACK;

EID: 68549092451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (10)

1. D. Boneh, R.A. Demillo, R.J. Lipton: On the Importance of Checking Cryptographic Protocols for Faults. In: W. Fumy (ed.): Advances in Cryptology - Eurocrypt '97, Lecture Notes in Computer Science, Vol. 1233. Springer, New York (1997) 37-51.
2. D. Coppersmith: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptology 10 (no. 4) (1997) 233-260.
3. J.-F. Dhern, 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, B. Schneier (eds.): CARDIS 1998, Third Smart Card Research and Advanced Application Conference (PreProceedings). Université catholique de Louvain (1998).
4. W. Feller: An Introduction to Probability Theory and Its Applications (Vol. 1). 3rd edition, revised printing, Wiley, New York (1970).
5. G. Hachez, J.-J. Quisquater: Montgomery Exponentiation with no Final Subtractions: Improved Results. To appear in: Ç.K. Koç, C. Paar (eds.): Workshop on Cryptographic Hardware and Embedded Systems, 2000 (Proceedings).
6. 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, Vol. 1109. Springer, Heidelberg (1996), 104-113.
7. A.J. Menezes, P.C. van Oorschot, S.C. Vanstone: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997).
8. P.L. Montgomery: Modular Multiplication without Trial Division. Math. Comp. 44 (no. 170) (1985) 519-521.
9. W. Schindler: Optimized Timing Attacks against Public Key Cryptosystems. Submitted.
10. C.D. Walter: Montgomery's Exponentiation Needs no Final Subtractions. Electronics letters 35 (no. 21) (1999), 1831-1832.