Abstract
This chapter mainly discusses robust and partially robust codes and their application to various cryptographic primitives. Initially, robust nonlinear codes are described in detail and their error detection capabilities are measured theoretically. Next, various nonlinear constructions are provided and their potential applications are described. More specifically, we discuss the protection of the AES data path, finite state machines (FSMs), and elliptic curve cryptosystems (ECCs). The main advantage of robust codes is that they are nonlinear and hence the success of an injected fault is data-dependent. As a result, error detection using nonlinear robust codes is one of the most effective solutions to active fault injection attacks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Acknowledgments
The authors would like to express their thanks to Dr. Deniz Karakoyunlu for his support and valuable discussions during the development of Sect. 11.8.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Akdemir, K.D., Wang, Z., Karpovsky, M., Sunar, B. (2012). Design of Cryptographic Devices Resilient to Fault Injection Attacks Using Nonlinear Robust Codes. In: Joye, M., Tunstall, M. (eds) Fault Analysis in Cryptography. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29656-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-29656-7_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29655-0
Online ISBN: 978-3-642-29656-7
eBook Packages: Computer ScienceComputer Science (R0)