| MIBS-64算法的三子集中间相遇攻击 |
| |
| 引用本文： | 许星霖,李艳俊,欧海文,孙启龙. MIBS-64算法的三子集中间相遇攻击[J]. 密码学报, 2022, 9(1): 164-174 |
| |
| 作者姓名： | 许星霖 李艳俊 欧海文 孙启龙 |
| |
| 作者单位： | 北京电子科技学院, 北京 100070;密码科学技术国家重点实验室, 北京 100878;中国电子科技集团公司第十五研究所, 北京 100083 |
| |
| 基金项目： | 中央高校基本科研业务费(328201901);广西密码与信息安全重点实验室开放课题(GCIS201912)。 |
| |
| 摘 要： | MIBS算法于2009年在CANS会议上提出,是一个32轮Feistel结构、64比特分组长度以及包含64比特、80比特两种主密钥长度的轻量级分组密码.针对该算法密钥编排中第1轮到第11轮子密钥之间存在部分重复和等价关系,本文首次完成了MIBS-64的11轮三子集中间相遇攻击,数据复杂度为247,存储复杂度为24764-bit,时间复杂度为262.25次11轮加密.与目前已有的对MIBS-64算法的中间相遇攻击相比,将攻击轮数由10轮扩展至11轮,刷新了该算法在中间相遇攻击下的安全性评估结果.
|
| 关 键 词： | 三子集 中间相遇攻击 轻量级分组密码 MIBS 密钥编排 |
3-subset Meet-in-the-middle Attack on Block Cipher MIBS-64 |
| |
| XU Xing-Lin,LI Yan-Jun,OU Hai-Wen,SUN Qi-Long. 3-subset Meet-in-the-middle Attack on Block Cipher MIBS-64[J]. , 2022, 9(1): 164-174 |
| |
| Authors: | XU Xing-Lin LI Yan-Jun OU Hai-Wen SUN Qi-Long |
| |
| Affiliation: | (Beijing Electronic Science and Technology Institute,Beijing 100070,China;State Key Laboratory of Cryptology,Beijing 100878,China;The 15th Research Institute of China Electronics Technology Group Company,Beijing 100083,China) |
| |
| Abstract: | MIBS is a lightweight block cipher with a 32-round Feistel structure,64-bit block length,and key lengths can be 64 bits or 80 bits.MIBS was proposed at CANS 2009 by Izadi,and the algorithm is designed for devices with extremely limited resources,such as RFID tags and sensors.According to the key schedule of MIBS,there are partially repeated and equal bits between the 1st to the 11th round keys.This paper presents a meet-in-the-middle attack on 11-round MIBS 3-subset with the data complexity of 2^[47],memory complexity of 2^[47] of 64-bit blocks,and time complexity of 2^[62.25] of 11-round encryptions.Compared with existing MITM attacks on MIBS-64,the round number is extended from 10 to 11,exceeding the security evaluation of MIBS-64 under MITM attack. |
| |
| Keywords: | 3-subset meet-in-the-middle attack lightweight block cipher MIBS key schedule |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
