| 李明明,郭建胜,崔竞一,徐林宏.Midori-64算法的截断不可能差分分析.软件学报,2019,30(8):0 |
| Midori-64算法的截断不可能差分分析 |
| Truncated Impossible Differential Cryptanalysis of Midori-64 |
| 投稿时间：2018-04-24 修订日期：2018-09-21 |
| DOI：10.13328/j.cnki.jos.005759 |
| 中文关键词: 密码分析 轻量级分组密码 Midori算法 不可能差分分析 截断不可能差分区分器 |
| 英文关键词:cryptanalysis lightweight block cipher Midori impossible differential cryptanalysis truncated impossible differential distinguisher |
| 基金项目:信息保障技术重点实验室开放基金（KJ-17-003） |
|
| 摘要点击次数: 172 |
| 全文下载次数: 65 |
| 中文摘要: |
| 分析了Midori-64算法在截断不可能差分攻击下的安全性.首先通过分析Midori算法加、解密过程差分路径规律，证明了Midori算法在单密钥条件下的截断不可能差分区分器至多6轮，并对6轮截断不可能差分区分器进行了分类.其次，根据分类结果，构造了一个6轮区分器，并给出11轮Midori-64算法的不可能差分分析，恢复了128比特主密钥，其时间复杂度为2121.4，数据复杂度为260.8，存储复杂度为296.5，该结果表明，本文给出了一个目前时间复杂度最低的11轮Midori-64算法分析. |
| 英文摘要: |
| The security of Midori-64 under truncated impossible differential cryptanalysis was studied.Firstly,by analyzing the differential paths of Midori in encryption and decryption process,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.The result shows that time complexity of the attacks on 11-round Midori-64 in this paper is the lowest so far. |
|
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |
