Improved Linear Cryptanalysis of Reduced-Round MIBS
- 698 Downloads
MIBS is a 32-round lightweight block cipher with 64-bit block size and two different key sizes, namely 64-bit and 80-bit keys. Bay et al. provided the first impossible differential, differential and linear cryptanalyses of MIBS. Their best attack was a linear attack on the 18-round MIBS-80. In this paper, we significantly improve their attack by discovering more approximations and mounting Hermelin et al.’s multidimensional linear cryptanalysis. We also use Nguyen et al.’s technique to have less time complexity. We attack on 19 rounds of MIBS-80 with a time complexity of 274.23 19-round MIBS-80 encryptions by using 257.87 plaintext-ciphertext pairs. To the best of our knowledge, the result proposed in this paper is the best cryptanalytic result for MIBS, so far.
Keywordsmultidimensional linear cryptanalysis lightweight block ciphers MIBS RFID tags sensor networks
Unable to display preview. Download preview PDF.
- [Her10]Hermelin, M.: Multidimensional Linear Cryptanalysis. Phd thesis (2010)Google Scholar
- [HN11]Hermelin, M., Nyberg, K.: Linear Cryptanalysis Using Multiple Linear Approximations. In: IACR Cryptology ePrint Archive, 2011/093Google Scholar
- [JR94]Kaliski Jr., B.S., Robshaw, M.J.B.: Linear Cryptanalysis Using Multiple Approximations. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 26–39. Springer, Heidelberg (1994)Google Scholar
- [Mat94a]Matsui, M.: The First Experimental Cryptanalysis of the Data Encryption Standard. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 1–11. Springer, Heidelberg (1994)Google Scholar