SIMON算法的差分—线性密码分析  

Differential-Linear Cryptanalysis of the SIMON Algorithm

作　　者：胡禹佳 代政一 孙兵[1,3] HU Yujia;DAI Zhengyi;SUN Bing(College of Science,National University of Defense Technology,Changsha 410073,China;College of ComputerScience and Technology,National University of Defense Technology,Changsha 410073,China;Hunan EngineeringResearch Center of Commercial Cryptography Theory and Technology Innovation,Changsha 410000,China)

机构地区：[1]国防科技大学理学院,长沙410073 [2]国防科技大学计算机学院,长沙410073 [3]商用密码理论与技术创新湖南省工程研究中心,长沙410000

出　　处：《信息网络安全》2022年第9期63-75,共13页Netinfo Security

基　　金：国家自然科学基金[62172427,61772545]。

摘　　要：差分分析和线性分析是目前分组密码算法攻击中较常见的两种方法,差分—线性分析是基于这两种方法建立的一种分析方法,近年来受到密码学界的广泛关注。SIMON算法是一种重要的轻量级密码算法,文章主要对SIMON 32/64和SIMON 48进行差分—线性分析,分别构造13轮差分—线性区分器,基于区分器分别进行16轮密钥恢复攻击,数据复杂度分别为2^(26)和2^(42),时间复杂度分别为2^(40.59)和2^(61.59),增加了SIMON算法的安全性评估维度,丰富了差分—线性分析的实际案例。Differential cryptanalysis and linear cryptanalysis are currently the two most common methods to evaluate the security of block ciphers.Differential-linear cryptanalysis is an analysis method based on these two methods,which has been widely studied by the cryptography community in recent years.SIMON algorithm is an important lightweight block cipher,this paper mainly performed differential-linear attacks on SIMON 32/64 and SIMON 48,constructed 13 rounds differential-linear distinguishers respectively,made 16 rounds of key recovery attacks,whose data complexities are 2^(26) and 2^(42),and time complexities are 2^(40.59) and 2^(61.59) respectively,thereby increased the security evaluation dimension of the SIMON algorithm and enriched the actual cases of differential-linear cryptanalysis.

关 键 词：轻量级分组密码 差分—线性分析 SIMON算法 

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