###
Journal of Software:2019.30(8):2337-2348

Midori-64算法的截断不可能差分分析
李明明,郭建胜,崔竞一,徐林宏
(信息工程大学, 河南 郑州 450001)
Truncated Impossible Differential Cryptanalysis of Midori-64
LI Ming-Ming,GUO Jian-Sheng,CUI Jing-Yi,XU Lin-Hong
(Information Engineering University, Zhengzhou 450001, China)
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 1161   Download 452
Received:April 24, 2018    Revised:September 21, 2018
> 中文摘要: 分析了Midori-64算法在截断不可能差分攻击下的安全性.首先,通过分析Midori算法加、解密过程差分路径规律,证明了Midori算法在单密钥条件下的截断不可能差分区分器至多6轮,并对6轮截断不可能差分区分器进行了分类;其次,根据分类结果,构造了一个6轮区分器,并给出11轮Midori-64算法的不可能差分分析,恢复了128比特主密钥,其时间复杂度为2121.4,数据复杂度为260.8,存储复杂度为296.5.
Abstract:The security of Midori-64 under truncated impossible differential cryptanalysis was studied. Firstly, by analyzing the differential paths of Midori in encryption and decryption direction, it was proved that the upper bound for the rounds of impossible differential distinguishers in single-key setting for Midori is 6. And the 6-round truncated impossible differential distinguisher was classified. Secondly, based on the classification, a 6-round distinguisher was constructed. At the same time the impossible differential attack on 11-round Midori-64 was given to recover the 128-bit master key with a time complexity of 2121.4 11-round encryptions, a data complexity of 260.8 chosen-plaintexts, and a memory complexity of 296.5 64-bit blocks.
文章编号:     中图分类号:TP309    文献标志码:
基金项目:信息保障技术重点实验室开放基金(KJ-17-003) 信息保障技术重点实验室开放基金(KJ-17-003)
Foundation items:Open Foundation of Science and Technology on Information Assurance Laboratory (KJ-17-003)
Reference text:

李明明,郭建胜,崔竞一,徐林宏.Midori-64算法的截断不可能差分分析.软件学报,2019,30(8):2337-2348

LI Ming-Ming,GUO Jian-Sheng,CUI Jing-Yi,XU Lin-Hong.Truncated Impossible Differential Cryptanalysis of Midori-64.Journal of Software,2019,30(8):2337-2348