东篱科研大数据发现系统（DRDS）

位置：成果数据库 > 期刊 > 期刊详情页

A Comprehensive Study of Algebraic Fault Analysis on PRINCE

ISSN号：1673-5447
期刊名称：China Communications
时间：2015.7.15
页码：127-141
分类：TP302.8[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术] O153.1[理学—数学;理学—基础数学]
作者机构：[1]College of Information Science and Electrical Engineering, Zhejiang University, Hangzhou, China, [2]The Institute of North Electronic Equipment, Beijing, China, [3]System Control Department of No.61541 Unit, Beijing, China
相关基金：supported in part by the Major State Basic Research Development Program （973 Plan） of China under thegrant 2013CB338004; the National Natural Science Foundation of China under the grants 61173191, 61271124, 61272491, 61309021, 61472357; by the Zhejiang Provincial Natural Science Foundation of China under the grant LY13F010001; by the Fundamental Research Funds for the Central Universities under the grant 2015QNA5005
相关项目：分组密码代数旁路攻击技术研究

作者： GUO Shize|SHEN Jizhong|HUANG Jing|HU Zijie|

关键词：故障分析, 子代数, 故障模型, 故障注入, AFA, 主密钥, DFA, 分组密码, algebraic fault analysis, PRINCE, Crypto Mini SAT

中文摘要：

PRINCE is a 64-bit lightweight block cipher with a 128-bit key published at ASIACRYPT 2012. Assuming one nibble fault is injected, previous different fault analysis(DFA) on PRINCE adopted the technique from DFA on AES and current results are different. This paper aims to make a comprehensive study of algebraic fault analysis(AFA) on PRINCE. How to build the equations for PRINCE and faults are explained. Extensive experiments are conducted. Under nibble-based fault model, AFA with three or four fault injections can succeed within 300 seconds with a very high probability. Under other fault models such as byte-based, half word-based, word-based fault models, the faults become overlapped in the last round and previous DFAs are difficult to work. Our results show that AFA can still succeed to recover the full master key. To evaluate security of PRINCE against fault attacks, we utilize AFA to calculate the reduced entropy of the secret key for given amount of fault injections. The results can interpret and compare the efficiency of previous work. Under nibble-based fault model, the master key of PRINCE can be reduced to 29.69 and 236.10 with 3 and 2 fault injections on average, respectively.

英文摘要：

PRINCE is a 64-bit lightweight block cipher with a 128-bit key published at ASIACRYPT 2012. Assuming one nibble fault is injected, previous different fault analysis（DFA） on PRINCE adopted the technique from DFA on AES and current results are different. This paper aims to make a comprehensive study of algebraic fault analysis（AFA） on PRINCE. How to build the equations for PRINCE and faults are explained. Extensive experiments are conducted. Under nibble-based fault model, AFA with three or four fault injections can succeed within 300 seconds with a very high probability. Under other fault models such as byte-based, half word-based, word-based fault models, the faults become overlapped in the last round and previous DFAs are difficult to work. Our results show that AFA can still succeed to recover the full master key. To evaluate security of PRINCE against fault attacks, we utilize AFA to calculate the reduced entropy of the secret key for given amount of fault injections. The results can interpret and compare the efficiency of previous work. Under nibble-based fault model, the master key of PRINCE can be reduced to 29.69 and 236.10 with 3 and 2 fault injections on average, respectively.

同期刊论文项目