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.
翻译:在CHES 2018 中, 持续断层攻击( PFA) 是最近提出的一种在 CHES 2018 中, 持续断层攻击( FA) 的方法。 它能够回收单一断层情景中的完整 AES 秘密密钥 。 事实证明, 传统的 FA 反措施, 如双模块重复( DMR) 和面具保护, 无法挫败 PFA 。 在本文中, 我们提出快速探测和错误校正算法, 以防止 PFA 。 我们建造了一个固定输入和输出对配方, 以快速检测断层。 然后我们再建两个多余的表格, 以存储S- box 中相邻元素之间的关系, 使算法能够纠正 S- box 中的错误元素 。 我们的实验结果显示, 我们的算法可以有效防止 PFA 在单一断层和多波段断层断层两种情况下 。 与传统的FA 反措施相比, 我们的算法对 PFA 效果要好得多。 此外, 我们的算法的时间成本比经典 FA反措施低40% 。