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.
CITATION STYLE
Akdemir, K. D., Wang, Z., Karpovsky, M., & Sunar, B. (2012). Design of cryptographic devices resilient to fault injection attacks using nonlinear robust codes. In Information Security and Cryptography (Vol. 17, pp. 171–199). Springer International Publishing. https://doi.org/10.1007/978-3-642-29656-7_11
Mendeley helps you to discover research relevant for your work.