Fault-based attack of RSA authentication

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2010, Pages 855-860

  Pellegrini, Andrea ^a   Bertacco, Valeria ^a   Austin, Todd ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; COMPUTER OPERATING SYSTEMS; CRYPTOGRAPHY; FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

COMPUTING SYSTEM; FPGA IMPLEMENTATIONS; HARDWARE AND SOFTWARE; MICROPROCESSOR SYSTEMS; MODULAR EXPONENTIATION ALGORITHMS; PRODUCTION SOFTWARE; SECRET INFORMATION; SECURITY ATTACKS;

HARDWARE SECURITY;

EID: 77953101933     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/date.2010.5456933     Document Type: Conference Paper

References (15)

1. OpenSSL: The Open Source toolkit for SSL/TLS. http://www.openssl.org.
2. C. Aumüller, P. Bier, W. Fischer, P. Hofreiter, and J.-P. Seifert. Fault attacks on RSA with CRT: Concrete results and practical countermeasures. In Proc. of the Workshop on Cryptographic Hardware and Embedded Systems, Aug 2003.
3. F. Bao, R. Deng, Y. Han, A. Jeng, D. Narasimhalu, and T.-H. Ngair. Breaking public key cryptosystems on tamper resistant devices in the presence of transient faults. In Proc. of the Workshop on Security Protocols, Apr 1998.
4. H. Bar-El, H. Choukri, D. Naccache, M. Tunstall, and C. Whelan. The sorcerer's apprentice guide to fault attacks. Proc. of the IEEE, Feb 2006.
5. E. Biham, Y. Carmeli, and A. Shamir. Bug Attacks. In Proc. of Advances in Cryptology, Aug 2008.
6. D. Boneh, R. Demillo, and R. Lipton. On the importance of eliminating errors in cryptographic computations. Journal of Cryptology, Dec 2001.
7. M. Boreale. Attacking right-to-left modular exponentiation with timely random faults. In Proc. of the Workshop of Fault Diagnosis and Tolerance in Cryptography, Oct 2006.
8. D. Brumley and D. Boneh. Remote timing attacks are practical. In Proc. of USENIX Security Symposium, Jun 2003.
9. K. Hamaguchi, A. Morita, and S. Yajima. Efficient construction of binary moment diagrams for verifying arithmetic circuits. In Proc. of the International Conference on Computer-Aided Design, Nov 1995.
10. M. Joye, A. Lenstra, and J.-J. Quisquater. Chinese remaindering based cryptosystems in the presence of faults. Journal of Cryptology, Dec 1999.
11. A. Menezes, P. V. Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, Oct. 1996.
12. J. Rabaey, A. Chandrakasan, and B. Nikolic. Digital Integrated Circuits. Prentice Hall, 2 edition, Jan 2003.
13. R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, Feb 1978.
14. J. Schmidt and C. Herbst. A practical fault attack on square and multiply. In Proc. of the Workshop of Fault Diagnosis and Tolerance in Cryptography, Aug 2008.
15. D. Wagner. Cryptanalysis of a provably secure CRT-RSA algorithm. In Proc. of the Conference on Computer and communications security, Oct 2004.