International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: ExpFault: An Automated Framework for Exploitable Fault Characterization in Block Ciphers

Authors:
Sayandeep Saha , Indian Institute of Technology, Kharagpur, India
Debdeep Mukhopadhyay , Indian Institute of Technology, Kharagpur, India
Pallab Dasgupta , Indian Institute of Technology, Kharagpur, India
Download:
DOI: 10.13154/tches.v2018.i2.242-276
URL: https://tches.iacr.org/index.php/TCHES/article/view/882
Search ePrint
Search Google
Abstract: Malicious exploitation of faults for extracting secrets is one of the most practical and potent threats to modern cryptographic primitives. Interestingly, not every possible fault for a cryptosystem is maliciously exploitable, and evaluation of the exploitability of a fault is nontrivial. In order to devise precise defense mechanisms against such rogue faults, a comprehensive knowledge is required about the exploitable part of the fault space of a cryptosystem. Unfortunately, the fault space is diversified and of formidable size even while a single cryptoprimitive is considered and traditional manual fault analysis techniques may often fall short to practically cover such a fault space within reasonable time. An automation for analyzing individual fault instances for their exploitability is thus inevitable. Such an automation is supposed to work as the core engine for analyzing the fault spaces of cryptographic primitives. In this paper, we propose an automation for evaluating the exploitability status of fault instances from block ciphers, mainly in the context of Differential Fault Analysis (DFA) attacks. The proposed framework is generic and scalable, which are perhaps the two most important features for covering diversified fault spaces of formidable size originating from different ciphers. As a proof-of-concept, we reconstruct some known attack examples on AES and PRESENT using the framework and finally analyze a recently proposed cipher GIFT [BPP+17] for the first time. It is found that the secret key of GIFT can be uniquely determined with 1 nibble fault instance injected at the beginning of the 25th round with a reasonable computational complexity of 214.
Video from TCHES 2018
Video provided under Creative Commons / CC BY 3.0
BibTeX
@article{tches-2018-28965,
  title={ExpFault: An Automated Framework for Exploitable Fault Characterization in Block Ciphers},
  journal={Transactions on Cryptographic Hardware and Embedded Systems},
  publisher={Ruhr-Universit├Ąt Bochum},
  volume={2018, Issue 2},
  pages={242-276},
  url={https://tches.iacr.org/index.php/TCHES/article/view/882},
  doi={10.13154/tches.v2018.i2.242-276},
  author={Sayandeep Saha and Debdeep Mukhopadhyay and Pallab Dasgupta},
  year=2018
}