Why one should also secure RSA public key elements

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

Volumn 4249 LNCS, Issue , 2006, Pages 324-338

  Brier, Eric ^a   Chevallier Marnes, Benoît ^a,b   Ciet, Mathieu ^a   Clavier, Christophe ^a  

^a GEMALTO   (France)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Fault cryptanalysis; RSA; Seifert's attack; Standard mode

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; INFORMATION RETRIEVAL; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; SECURITY OF DATA;

FAULT ATTACK; FAULT CRYPTANALYSIS; FAULT MODEL; SEIFERT'S ATTACK; STANDARD MODE;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33750696616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11894063_26     Document Type: Conference Paper

References (17)

1. C. Aumüller, P. Bier, W. Fischer, P. Hofreiter, J.-P. Seifert. Fault attacks on RSA with CRT: Concrete results and practical countermeasures. In CHES 2002, volume 2523 of LNCS, pages 260-275
2. H. Bar-El, H. Choukri, D. Naccache, M. Tunstall, and C. Whelan. The sorcerer's apprentice guide to fault attacks. In Workshop on Fault Detection and Tolerance in Cryptography, 2004
3. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In 1st ACM Conference, on Computer and Communications Security, pages 62-73. ACM Press, 1993.
4. M. Bellare and P. Rogaway. The exact security of digital signatures - How to sign with RSA and Rabin. In Advances in Cryptology - EUROCRYPT '96, volume 1070 of LNCS, pages 399-416. Springer, 1996.
5. I. Biehl, B. Meyer, and V. Müller. Differential fault analysis on elliptic curve cryptosystems. In Advances in Cryptology - CRYPTO 2000, vol. 1880 of LNCS, pages 131-146. Springer, 2000.
6. D. Boneh, R.A. DeMillo, and R.J. Lipton. On the importance of checking cryptographic protocols for faults. In W. Fumy, editor, Advances in Cryptology - EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, pages 37-51. Springer-Verlag, 1997.
7. D. Boneh, R.A. DeMillo, and R.J. Lipton. On the importance of eliminating errors in cryptographic computations. Journal of Cryptology 14(2):101-119, 2001. An earlier version appears in [6].
8. M. Ciet and M. Joye. Elliptic curve cryptosystem in presence of permanent and transient faults. Designs Codes and Cryptography 36(1), 2005.
9. J.-S. Coron. Optimal security proofs for PSS and other signature schemes, In Advances in Cryptology - EUROCRYPT '02, volume 2332 of LNCS, pages 272-287. Springer, 2002.
10. M. Joye, A.K. Lenstra, and J.-J. Quisquater. Chinese remaindering based cryptosystems in the presence of faults. Journal of Cryptology 12(4):241-245, 1999.
11. P.C. Kocher, J. Jaffe, and B. 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. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone. Handbook of applied cryptography. CRC Press, 1997.
13. J.A. Muir. Seiferts RSA fault attack: Simplified analysis and generalizations. IACR Eprint archive 2005.
14. PKCS #1 vl.5: RSA Cryptography Standard.
15. J.-J. Quisquater and C. Couvreur. Fast decipherment algorithm for RSA public-key cryptosystem. Electronics Letters 18(21):905-907, 1982.
16. R.L. Rivest, A. Shamir, and L.M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2):120-126, 1978.
17. J.-P. Seifert. On authenticated computing and RSA-based authentication. ACM Conference on Computer and Communications Security 2005: pages 122-127, 2005.