【摘要】 MIBS算法是2009年在CANS会议上提出的轻量级分组密码,其目标是应用于极其有限的资源环境,例如RFID标签和传感器网络.它基于32轮Feistel结构、分组长度64比特,包含64比特、80比特两种主密钥长度.本文基于该算法的密钥编排中第1轮到第11轮子密钥之间存在部分重复和等价关系,给出了一类5轮积分区分器.在此积分区分器的基础上,向前加3轮,向后加3轮,首次完成了MIBS-64的11轮积分攻击.攻击数据复杂度为2⁵⁸,时间复杂度为2^59.75次11轮加密,攻击成功概率为100%.该结果可以类似地推广到MIBS-80.更多还原

【Abstract】 MIBS is a lightweight block cipher with a 32-round Feistel structure, 64-bit block length,and the master can be of 64 bits or 80 bits long. MIBS was proposed by Izadi M. I. at CANS2009,it was designed for resource-constrained devices such as RFID tags and sensors. According to the key schedule of MIBS, there exist partially repeated and equivalent bits between the 1 st to the 11 th round keys. Based on that, a class of 5-round integral distinguishers are designed. On the basis of the5-round integral distinguisher, adding 3 rounds forward and 3 rounds backward, this paper presents a11-round MIBS integral attack, which has the data complexity of 2⁵⁸, time complexity of 2^59.75, and 100% success rate. This result can be similarly extended to MIBS-80.更多还原