【摘要】 MIBS算法于2009年在CANS会议上提出,是一个32轮Feistel结构、64比特分组长度以及包含64比特、80比特两种主密钥长度的轻量级分组密码.针对该算法密钥编排中第1轮到第11轮子密钥之间存在部分重复和等价关系,本文首次完成了MIBS-64的11轮三子集中间相遇攻击,数据复杂度为2⁴⁷,存储复杂度为2⁴⁷64-bit,时间复杂度为2^62.25次11轮加密.与目前已有的对MIBS-64算法的中间相遇攻击相比,将攻击轮数由10轮扩展至11轮,刷新了该算法在中间相遇攻击下的安全性评估结果.更多还原

【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⁴⁷,memory complexity of 2⁴⁷of 64-bit blocks,and time complexity of 2^62.25of 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.更多还原