Reduction in Number of Fault Injections for Blind Fault Attack on SPN Block Ciphers
In 2014, a new fault analysis called blind fault attack (BFA) was proposed, in which the attackers can only obtain the number of different faulty outputs without knowing the public data.The original BFA requires 480,000 fault injections to recover a 128-bit AES key.This work attempts to reduce the number of fault injections under the same attack assumptions.Wc analyze BFA from an information theoretical perspective and introduce a new probabilitybased distinguisher.Three approaches are proposed for different attack scenarios.The best one realized a 66.8% reduction of the number of fault injections on AES.
Yang Li Jian Wang
College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics
国内会议
北京
英文
183-198
2016-08-29（万方平台首次上网日期，不代表论文的发表时间）