Differential cryptanalysis analyzes ciphers by studying the development of differences during encryption. Linear cryptanalysis is similar but is based on studying approximate linear relations. In 1994, Langford and Hellman showed that both kinds of analysis can be combined together by a technique called differential-linear cryptanalysis, in which the differential part creates a linear approxima...

In this paper, we discuss some of theory of provable security against differential and linear cryptanalysis. We also review the design principles of the block cipher KASUMI—especially its resistance against the basic forms of linear and differential cryptanalysis.

This paper mainly studies mixed integer linear programming (MILP)-based cryptanalysis on round-reduced NBC algorithm with generalized Feistel structure. First, each component of the is equivalently described by inequality equations, and propagation rules differential characteristics approximation are described, an automatic search model mode mask based MILP established, minimum number active S-...

Bent or perfect nonlinear Boolean functions represent the best resistance against the so-called linear and differential cryptanalysis. But this kind of cryptographic relevant functions only exists when the number of input bits m is an even integer and is larger than the double of the number of output bits n. Unfortunately the non-existence cases, the odd dimension (m is an odd integer) or the p...

In 1989–1990, two new hash functions were presented, Snefru and MD4. Snefru was soon broken by the newly introduced differential cryptanalysis, while MD4 remained unbroken for several more years. As a result, newer functions based on MD4, e.g., MD5 and SHA-1, became the de-facto and international standards. Following recent techniques of differential cryptanalysis for hash function, today we kn...

Differential and linear attacks are the most widely used cryptanalytic tools to evaluate the security of symmetric-key cryptography. Since the introduction of differential and linear attacks in the early 1990’s, various variants of these attacks have been proposed such as the truncated differential attack, the impossible differential attack, the square attack, the boomerang attack, the rectangl...

In recent years, three main types of attacks have been developed against Feistel-based ciphers, such as DES[1]; these attacks are linear cryptanalysis[2], differential cryptanalysis[3], and the Davies and Murphy attack[4]. Using the discrete Fourier transform, we present here a quantitative criterion of security against the Davies and Murphy attack. Similar work has been done on linear and diff...

This paper presents an approach for the comparative study on Data Encryption Standard (DES) using Differential Cryptanalysis and Linear cryptanalysis. In this paper, cipher text only attack is adopted and varieties of optimum keys are generated based on the cost function values. The goal of this paper is two fold. First we want to make a study about how evolutionary computation techniques can e...

In this paper, we revisit the famous Davies-Murphy cryptanalysis of DES. First we improve its complexity down to the analysis of 2 chosen plaintexts, by considering 6 distributions instead of 7. The previous improvement of the attack by Biham and Biryukov costed 2 known plaintexts. This new result is better than differential cryptanalysis but slightly worse than linear cryptanalysis. Secondly, ...