Improved Differential Analysis of MIBS Based on Greedy Algorithm

ePrint Report: Improved Differential Analysis of MIBS Based on Greedy Algorithm

Jian Liu, Yanjun Li, Runyi Liu, Jian Zou, Zhiqiang Wang

MIBS is a 32-round lightweight block cipher following a Feistel structure with the block length of 64-bit and the key length of 64 or 80 bits. In this paper, the properties of the key scheduling algorithm are investigated and lots of repeated bits among the different round keys are found. Moreover, the optimal guessing order of the unknown key …

64-bit algorithm analysis bits block cipher eprint report greedy key keys length report the key