سند علمی

Truncated and Multiple Differential Cryptanalysis of Reduced Round Midori128

چکیده

Midori is a family of SPN-based lightweight block ciphers designed to optimize the hardware energy consumption per bit during the encryption and decryption operations. At ASIACRYPT 2015, two variants of the cipher, namely Midori128 and Midori64, which support a 128-bit secret key and a 64/128-bit block, respectively, were proposed. Recently, a meet-in-the-middle attack and an invariant subspace attack were presented against Midori64 but both attacks cannot be applied to Midori128. In this paper, we present truncated and multiple differential cryptanalysis of round reduced Midori128. Our analysis utilizes the special structure of the S-boxes and binary linear transformation layer in order to minimize the number of active S-boxes. In particular, we consider differentials that contain only single bit differences in the input and output of the active S-boxes. To keep this single bit per S-box patterns after the MixColumn operation, we restrict the bit differences of the output of the active S-boxes, which lie in the same column after the shuffle operation, to be in the same position. Using these restrictions, we were able to find 10-round differential which holds with probability 2−118. By adding two rounds above and one round below this differential, we obtain a 13 round truncated differential and use it to perform a key recovery attack on the 13-round reduced Midori128. The time and data complexities of the 13-round attack are 2 encryptions and 2 chosen plaintext, respectively. We also present a multiple differential attack on the 13-round Midori128, with time and data complexities of 2 encryptions and 2 chosen plaintext, respectively.

اسناد مشابه

  • Improved Differential Cryptanalysis of Round-Reduced Speck

    سند علمی۲۰۱۴IACR Cryptology ePrint ArchiveItai Dinur

    Simon and Speck are families of lightweight block ciphers designed by the U.S. National Security Agency and published in 2013. Each of the families contains 10 variants, supporting a wide range of block and key sizes. Since the publication of Simon and Speck, several research pap

  • Differential Cryptanalysis of Round-Reduced PRINTcipher: Computing Roots of Permutations

    سند علمی۲۰۱۱FSEMohamed Ahmed Abdelraheem, Gregor Leander, Erik Zenner

    At CHES 2010, the new block cipher PRINTcipher was presented. In addition to using an xor round key as is common practice for round-based block ciphers, PRINTcipher also uses key-dependent permutations. While this seems to make differential cryptanalysis difficult due to the unkn

  • Differential Cryptanalysis of Round-Reduced Simon and Speck

    سند علمی۲۰۱۴FSEFarzaneh Abed, Eik List, Stefan Lucks, Jakob Wenzel

    This paper presents differential attacks on Simon and Speck, two families of lightweight block ciphers that were presented by the U.S. National Security Agency in June 2013. We describe attacks on up to slightly more than half the number of rounds. While our analysis is only of a

  • Multiple Differential Cryptanalysis Using LLR and χ Statistics

    سند علمی۲۰۱۲Céline Blondeau, Kaisa Nyberg

    Recent block ciphers have been designed to be resistant against differential cryptanalysis. Nevertheless it has been shown that such resistance claims may not be as accurate as wished due to recent advances in this field. One of the main improvements to differential cryptanalysis

  • Multiple Differential Cryptanalysis: Theory and Practice

    سند علمی۲۰۱۱FSECéline Blondeau, Benoît Gérard

    Differential cryptanalysis is a well-known statistical attack on block ciphers. We present here a generalisation of this attack called multiple differential cryptanalysis. We study the data complexity, the time complexity and the success probability of such an attack and we exper

  • Multiple Differential Cryptanalysis: Theory and Practice (Corrected)

    سند علمی۲۰۱۱IACR Cryptology ePrint ArchiveCéline Blondeau, Benoît Gérard

    Differential cryptanalysis is a well-known statistical attack on block ciphers. We present here a generalisation of this attack called multiple differential cryptanalysis. We study the data complexity, the time complexity and the success probability of such an attack and we exper