Impossible Differential Cryptanalysis of Reduced-Round MIBS Block Cipher
This MIBS is a lightweight block cipher designed by M. lzadi et al in 2009 for extremely constrained environments such as RFID tags and sensor networks. In this paper, an 8-round impossible differential is found and the strength of MIBS against the impossible differential attack is explored. By exploiting the relations between the round subkeys and some new observations on the diffusion transformation of MIBS, together with some techniques in the key recovery process, we can give an impossible differential attack on 12-round MIBS 64. The data complexity is 259 chosen plaintexts, and the time complexity is 258.8 12-round MIBS-64 computations.
block cipher cryptanalysis MIBS impossible differential cryptanalysi round subkey
Gaoli Wang Wei Li Shaohui Wang
School of Computer Science and Technology Donghua University Shanghai, China State Key Laboratory of School of Computer Science and Technology Donghua University Shanghai, China Nanjing University of Posts and Telecommunications Nanjing, China
国际会议
成都
英文
78-82
2010-12-17(万方平台首次上网日期,不代表论文的发表时间)