International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Meet-in-the-Middle Attacks on Reduced-Round Midori64

Authors:
Li Lin , TCA Laboratory, SKLCS, Institute of Software, Chinese Academy of Sciences, Beijing
Wenling Wu , TCA Laboratory, SKLCS, Institute of Software, Chinese Academy of Sciences, Beijing
Download:
DOI: 10.13154/tosc.v2017.i1.215-239
URL: http://tosc.iacr.org/index.php/ToSC/article/view/592
Search ePrint
Search Google
Abstract: Midori is a lightweight block cipher designed by Banik et al. at ASIACRYPT 2015 to achieve low energy consumption. One version of Midori uses a 64-bit state, another uses a 128-bit state and we denote these versions Midori64 and Midori128. Each of these versions uses a 128-bit key. In this paper, we focus on the key-recovery attacks on reduced-round Midori64 with meet-in-the-middle method. We use the differential enumeration, key-bridging and key-dependent sieve techniques which are popular to analyze AES to attack Midori64. Using key-bridging and key-dependent sieve techniques directly to achieve the complexity lower bound is almost impossible, we give the model on how to achieve the complexity lower bound using these techniques. We also propose the state-bridge technique to use some key relations that are quite complicated and divided by some rounds. With a 6-round distinguisher, we achieve a 10-round attack. After that, by adding one round at the end, we get an 11-round attack. Finally, with a 7-round distinguisher, we get an attack on 12-round Midori64. To the best of our knowledge, these are recently the best attacks on Midori64 in the single-key setting.
BibTeX
@article{tosc-2017-28111,
  title={Meet-in-the-Middle Attacks on Reduced-Round Midori64},
  journal={IACR Trans. Symmetric Cryptol.},
  publisher={Ruhr-Universit├Ąt Bochum},
  volume={2017, Issue 1},
  pages={215-239},
  url={http://tosc.iacr.org/index.php/ToSC/article/view/592},
  doi={10.13154/tosc.v2017.i1.215-239},
  author={Li Lin and Wenling Wu},
  year=2017
}