A Fast-Detection and Fault-Correction Algorithm against Persistent Fault Attack

TL;DR

This paper introduces a rapid detection and correction algorithm to defend against Persistent Fault Attacks on AES, significantly improving security and efficiency over traditional countermeasures.

Contribution

It proposes a novel fast-detection and fault-correction algorithm that effectively prevents PFA, outperforming classical countermeasures in both effectiveness and speed.

Findings

Effectively prevents PFA in single and multiple-byte fault scenarios

Reduces detection and correction time by 40% compared to classical methods

Demonstrates robustness against persistent fault attacks in experiments

Abstract

Persistent Fault Attack (PFA) is a recently proposed Fault Attack (FA) method in CHES 2018. It is able to recover full AES secret key in the Single-Byte-Fault scenario. It is demonstrated that classical FA countermeasures, such as Dual Modular Redundancy (DMR) and mask protection, are unable to thwart PFA. In this paper, we propose a fast-detection and faultcorrection algorithm to prevent PFA. We construct a fixed input and output pair to detect faults rapidly. Then we build two extra redundant tables to store the relationship between the adjacent elements in the S-box, by which the algorithm can correct the faulty elements in the S-box. Our experimental results show that our algorithm can effectively prevent PFA in both Single-ByteFault and Multiple-Bytes-Faults scenarios. Compared with the classical FA countermeasures, our algorithm has a much better effect against PFA. Further, the time cost of our algorithm is 40% lower than the classical FA countermeasures.