A Study of Persistent Fault Analysis
A Study of Persistent Fault Analysis
复制标题
DOI:
10.1007/978-3-030-35869-3_4
复制
发表时间:
2019-12
期刊:
影响因子:
--
通讯作者:
Andrea Caforio;S. Banik
中科院分区:
文献类型:
--
作者:
Andrea Caforio;S. Banik
Persistent faults mark a new class of injections that perturb lookup tables within block ciphers with the overall goal of recovering the encryption key. Unlike earlier fault types persistent faults remain intact over many encryptions until the affected device is rebooted, thus allowing an adversary to collect a multitude of correct and faulty ciphertexts. It was shown to be an efficient and effective attack against substitution-permutation networks. In this paper, the scope of persistent faults is further broadened and explored. More specifically, we show how to construct a key-recovery attack on generic Feistel schemes in the presence of persistent faults. In a second step, we leverage these faults to reverse-engineer AES- and PRESENT-like ciphers in a chosen-key setting, in which some of the computational layers, like substitution tables, are kept secret. Finally, we propose a novel, dedicated, and low-overhead countermeasure that provides adequate protection for hardware implementations against persistent fault injections.