Known-plaintext-only attack on RSA-CRT with Montgomery multiplication

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

Volumn 5747 LNCS, Issue , 2009, Pages 128-140

  Hlaváč, Martin ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Chinese remainder theorem; Electronic passport; Hidden number problem; Montgomery exponentiation; RSA; Side channel attack

Indexed keywords

CHINESE REMAINDER THEOREM; ELECTRONIC PASSPORT; HIDDEN NUMBER PROBLEM; MONTGOMERY EXPONENTIATION; RSA; SIDE CHANNEL ATTACK;

FACTORIZATION; FLUORESCENT SCREENS; PROBLEM SOLVING; TELEVISION PICTURE TUBES;

EMBEDDED SYSTEMS;

EID: 70350583038     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04138-9_10     Document Type: Conference Paper

References (17)

1. Babai, L.: On Lovász' lattice reduction and the nearest lattice point problem (shortened version). In: Mehlhorn, K. (ed.) STACS 1985. LNCS, vol. 182, pp. 13-20. Springer, Heidelberg (1984)
2. Boneh, D., Venkatesan, R.: Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 129-142. Springer, Heidelberg (1996)
3. Finkenzeller, K.: RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 2nd edn. John Wiley & Sons, Chichester (2003)
4. Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 31-51. Springer, Heidelberg (2008)
5. International Civil Aviation Organization (ICAO). Development of a Logical Data Structure - LDS for Optional Capacity Expansion Technologies, http://www.iso.org/iso/iso-catalogue/catalogue-tc/catalogue-detail.htm?csnumber= 39693
6. International Civil Aviation Organization (ICAO). Doc 9303, Machine Readable Travel Documents, http://www2.icao.int/en/MRTD/Pages/Doc9393.aspx
7. International Organization for Standardization. ISO/IEC 7816 - Identification cards - Contactless integrated circuit cards - Proximity cards, http://www.iso.org/iso/iso-catalogue/catalogue-tc/catalogue-detail.htm?csnumber= 39693
8. International Organization for Standardization. ISO/IEC 7816 - Identification cards - Integrated circuit(s) with contacts, http://www.iso.org/ iso/iso-catalogue/catalogue-tc/catalogue-detail.htm?csnumber=38770
9. Lenstra, A.K., Lenstra Jr., H.W., Lovász, L.: Factoring polynomials with rational coefficients. Mathematische Ann. 261, 513-534 (1982)
10. Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation 44, 519-521 (1985)
11. Nguyên, P.Q.: Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto 1997. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 288-304. Springer, Heidelberg (1999)
12. Nguyen, P.Q., Shparlinski, I.: The insecurity of the Digital Signature Algorithm with partially known nonces. J. Cryptology 15(3), 151-176 (2002)
13. Philips Electronics N.V. P5CD072 - Secure Dual Interface PKI Smart Card Controller, http://www.nxp.com/acrobat-download/other/identification/sfs095412. pdf
14. Schindler,W.: A timing attack against RSA with the Chinese Remainder Theorem. In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 109-124. Springer, Heidelberg (2000)
15. Schnorr, C.-P., Euchner, M.: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Math. Program. 66, 181-199 (1994)
16. Shoup, V.: NTL: A Library for doing Number Theory (2008), http://www.shoup.net/ntl/
17. Tomoeda, Y., Miyake, H., Shimbo, A., Kawamura, S.-i.: An SPA-based extension of Schindler's timing attack against RSA using CRT. IEICE Transactions 88-A(1), 147-153 (2005)