impossible differential cryptanalysis of reduced-round midori64 block cipher (extended version)

Impossible differential attack is a well-known mean to examine robustness of block ciphers. using impossible differential cryptanalysis, we analyze security of a family of lightweight block ciphers, named midori, that are designed considering low energy consumption. midori state size can be either 64 bits for midori64 or 128 bits for midori128; however, both versions have key size equal to 128 bits. in this paper, we mainly study security of midori64. to this end, we use various techniques such as early-abort, memory reallocation, miss-in-the-middle and turning to account the inadequate key schedule algorithm of midori64. we first show two new 7-round impossible differential characteristics which are, to the best of our knowledge, the longest impossible differential characteristics found for midori64. based on the new characteristics, we mount three impossible differential attacks on 10, 11, and 12 rounds on midori64 with 287:7, 290:63, and 290:51 time complexity, respectively, to retrieve the master-key.