21轮CRAFT算法不可能差分分析  

Impossible differential cryptanalysis of 21-round CRAFT

作　　者：石新蕾 刘亚[1,2,3] 陆海宁[4] 王凌云[5] Shi Xinlei;Liu Ya;Lu Haining;Wang Lingyun(School of Optical-Electrical&Computer Engineering,University of Shanghai for Science&Technology,Shanghai 200093,China;Shanghai Key Laboratory of Modern Optical System,University of Shanghai for Science&Technology,Shanghai 200093,China;Dept.of Computer Science&Engineering,Shanghai Jiao Tong University,Shanghai 200240,China;Dept.of Electronic&Electrical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China;Shanghai Viewsource Information Science&Technology Co.Ltd.,Shanghai 200241,China)

机构地区：[1]上海理工大学光电信息与计算机工程学院,上海200093 [2]上海理工大学上海市现代化光学重点实验室,上海200093 [3]上海交通大学计算机科学与工程系,上海200240 [4]上海交通大学电子信息与电气工程学院,上海200240 [5]上海观源信息科技有限公司,上海200241

出　　处：《计算机应用研究》2021年第9期2825-2830,共6页Application Research of Computers

基　　金：“十三五”密码发展基金理论课题(MMJJ20180202);上海市“科技创新行动计划”高新技术领域项目(19511103900);闵行区中小企业技术创新计划资助项目(2018MH110)。

摘　　要：CRAFT是FSE 2019年提出的一种轻量级可调分组密码,适用于硬件实现面积小且资源受限设备保护信息的安全。该算法使用128 bit密钥和64 bit调柄值加密64 bit明文,对其进行安全性评估,可以为日后使用提供理论依据。通过研究CRAFT的结构特点和密钥编排方案的冗余性,利用预计算表、等效密钥和轮密钥线性关系等技术,选取一条充分利用密钥冗余性的13轮不可能差分链,在其前后分别接3轮和5轮,提出了对21轮CRAFT的不可能差分分析。攻击的时间、数据和存储复杂度为296.74次加密,253.6个选择明文和256.664-比特块。此攻击是对缩减轮CRAFT算法在单密钥和单调柄值情形下时间复杂度最低的分析。该方法依赖于调柄值调度算法的线性相关,有助于更进一步理解CRAFT的设计。CRAFT is a lightweight tweakable block cipher proposed in FSE 2019,which is suitable for the resource-constrained equipment with the small hardware area to protect information security.It adopts the128 bit key and 64 bit tweak to encrypt a 64 bit plaintext.The evaluation of its safety can provide a theoretical basis for future use.The paper researched the structural properties of CRAFT and the redundancy of its key schedule,and chose a 13-round impossible differential of CRAFT,which made full use of the linear relations of round subkeys.Appended three rounds and five rounds at its top and bottom,this paper proposed a 21-round impossible differential,which applied some techniques such as the precomputation tables,the differential enumeration and the key-dependent property.The time,data and memory complexities of the attack were 296.74 encryptions,253.6 chosen plaintexts and 256.664 bit blocks,respectively.This impossible differential attack on reduced-round CRAFT was the lowest time complexity attack under the single-key and single-tweak model.This method relied on the linear correlation of the handle value tweakey schedule,which was helpful to further understand the design of CRAFT.

关 键 词：轻量级分组密码 可调分组密码 CRAFT 不可能差分分析 

分 类 号：TN918.4[电子电信—通信与信息系统]