Fault-Propagate Pattern Based DFA on PRESENT and PRINTcipher  

作　　者：ZHAO Xinjie GUO Shize WANG Tao ZHANG Fan SHI Zhijie 

机构地区：[1]Department of Computer Engineering, Ordnance EngineeringCollege, Shijiazhuang 050003, Hebei, China [2]The Institute of North Electronic Equipment, Beijing100083, China [3]Department of Computer Science and Engineering, Universityof Connecticut, Storrs 06269, USA

出　　处：《Wuhan University Journal of Natural Sciences》2012年第6期485-493,共9页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foundation ofChina (60772082,61173191,and 61272491)

摘　　要：This article proposes an enhanced differential fault analysis（DFA） method named as fault-propagation pattern-based DFA（FPP-DFA）.The main idea of FPP-DFA is using the FPP of the ciphertext difference to predict the fault location and the fault-propagation path.It shows that FPP-DFA is very effective on SPN structure block ciphers using bitwise permutation,which is applied to two block ciphers.The first is PRESENT with the substitution permutation sequence.With the fault model of injecting one nibble fault into the r-2nd round,on average 8 and 16 faults can reduce the key search space of PRESENT-80/128 to 214.7 and 221.1,respectively.The second is PRINTcipher with the permutation substitution sequence.For the first time,it shows that although the permutation of PRINTcipher is secret key dependent,FPP-DFA still works well on it.With the fault model of injecting one nibble fault into the r-2nd round,12 and 24 effective faults can reduce the key search space of PRINTcipher-48/96 to 213.7 and 222.8,respectively.This article proposes an enhanced differential fault analysis（DFA） method named as fault-propagation pattern-based DFA（FPP-DFA）.The main idea of FPP-DFA is using the FPP of the ciphertext difference to predict the fault location and the fault-propagation path.It shows that FPP-DFA is very effective on SPN structure block ciphers using bitwise permutation,which is applied to two block ciphers.The first is PRESENT with the substitution permutation sequence.With the fault model of injecting one nibble fault into the r-2nd round,on average 8 and 16 faults can reduce the key search space of PRESENT-80/128 to 214.7 and 221.1,respectively.The second is PRINTcipher with the permutation substitution sequence.For the first time,it shows that although the permutation of PRINTcipher is secret key dependent,FPP-DFA still works well on it.With the fault model of injecting one nibble fault into the r-2nd round,12 and 24 effective faults can reduce the key search space of PRINTcipher-48/96 to 213.7 and 222.8,respectively.

关 键 词：fault-propagation pattern differential fault analysis bitwise permutation SPN block cipher PRESENT PRINTcipher 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]