  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.
