Improved Meet-in-the-Middle Attacks on Reduced-Round DES

Dunkelman, Orr; Sekar, Gautham; Preneel, Bart

doi:10.1007/978-3-540-77026-8_8

Cited by 38 publications

(26 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A future possible line of work is to investigate some possible combinations with other existing MITM improvements: with the guess of intermediate state bits [21], or with the all-subkeys approach [24]. A promising direction would be to try to make a first selection within each of the two lists before the merging step, by keeping only the input values (resp.…”

Section: Discussionmentioning

confidence: 99%

“…They showed that a meet-in-the-middle key recovery could be applied to six rounds and they gave an upper bound of seven DES rounds to the range of their method. Latter in [21] the efficiency of the meet-in-the-middle was improved for reduced versions of DES to 4, 5, and 6 rounds. Though there exists a meet-in-the-middle attack on 7 rounds of DES that does not start from the first round, ours is the first to reach 7 rounds starting from the beginning (and also 8).…”

Section: Previous Mitm Cryptanalyses Of Reduced Desmentioning

confidence: 99%

“…Through the years, they have been applied for analyzing the security of a substantial number of cryptographic primitives, including block ciphers, stream ciphers and hash functions, e.g. [36,8,21,24,23]. They exploit the fact that some internal state in the middle of the cipher can be computed both forwards from the plaintext and backwards from the ciphertext, and that none of these computations requires the knowledge of the whole master key.…”

Section: Introductionmentioning

confidence: 99%

“…The attacker then only keeps the (partial) key candidates which lead to a collision in that internal state and discards all the other keys. This generic attack has drawn a lot of attention and raised many improvements, including the partial matching, where the computed internal states are not completely known, the technique of guessing some bits of the internal state [21], the all-subkeys approach [24], splice-and-cut [3,4,22] and bicliques [30]. The most popular application of bicliques is an accelerated exhaustive search on the full AES [6].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Sieve-in-the-Middle: Improved MITM Attacks

Canteaut

Naya-Plasencia

Vayssière

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents a new generic technique, named sieve-in-the-middle, which improves meet-in-the-middle attacks in the sense that it provides an attack on a higher number of rounds. Instead of selecting the key candidates by searching for a collision in an intermediate state which can be computed forwards and backwards, we here look for the existence of valid transitions through some middle sbox. Combining this technique with short bicliques allows to freely add one or two more rounds with the same time complexity. Moreover, when the key size of the cipher is larger than its block size, we show how to build the bicliques by an improved technique which does not require any additional data (on the contrary to previous biclique attacks). These techniques apply to PRESENT, DES, PRINCE and AES, improving the previously known results on these four ciphers. In particular, our attack on PRINCE applies to 8 rounds (out of 12), instead of 6 in the previous cryptanalyses. Some results are also given for theoretically estimating the sieving probability provided by some subsets of the input and output bits of a given sbox.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Previous Mitm Cryptanalyses Of Reduced Desmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Sieve-in-the-Middle: Improved MITM Attacks

Canteaut

Naya-Plasencia

Vayssière

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This is far easier than 2112 attempts. As a result of the meet-in-middle attack, Double DES has not been widely used [4].…”

Section: B Meet-in-middle Attackmentioning

confidence: 99%

An Innovative Approach to Enhance the Security of Data Encryption Scheme

Ojha¹,

Singh²,

Sharma³

et al. 2010

IJCTE

View full text Add to dashboard Cite

Abstract-In this paper, we proposed a new scheme to enhance the security of data Encryption scheme. With cascading of data encryption standard in three times, we become able to counter the famous meet in middle attack in double and triple data encryption standard. We show how the random key stream can be used to create lifetime supply of keys for one time pads. Here we provided the practical approach that we can use to set up our own one-time pad encryption. For simplicity let's study how randomized key can be achieved. Random key generation can simply be obtained via use of permutation. Permutation technique can be used in conjunction with other technique includes substitution, encryption function etc. for effective performance. The goal of this article to show how the one-time pad encryption technique can be achieved by the suitable combination of these techniques.

show abstract