Differential cryptanalysis of the Data Encryption Standard
Differential cryptanalysis is a powerful new type of cryptanalysis attack invented by the authors, which has been successfully applied to iterated cryptosystems and hash functions. It is one of few examples of methods of cryptanalysis that have become known in the open literature, which can not only be applied to a single cipher but to a whole variety of encryption and hash functions. The best known and most widely used iterated cryptosystem is the block cipher DES (Data Encryption Standard). The key size of DES is 56 bits and the block size 64 bits. This block is divided into two halves of 32 bits each. A crucial part of the round- function is the \(F\) function, which works on the right half of the data using a subkey of 48 bits and eight (six-bit to four-bit) \(S\) boxes. The 32 output bits of the \(F\) function are XORed with the left half of the data and the two halves are exchanged. (A complete description of the DES algorithm is given in Appendix A of the present book.) Differential cryptanalysis is a method which analyzes the effect of particular differences in plaintext pairs on the difference of the resulting ciphertext pairs. These differences can be used to assign probabilities to the possible keys and to estimate the most probable key. This procedure in most cases needs many pairs of plaintexts with the same particular difference using the resulting ciphertext pairs. For DES and many other DES-like cryptosystems the difference is chosen as a fixed XORed value of the two plaintexts. Differential cryptanalysis is a chosen plaintext attack which can often be converted into a known plaintext attack. In order to describe the method of differential cryptanalysis, DES is taken as the canonical example of an iterated cryptosystem, but similar ideas can be carried over to other iterated cryptosystems by taking an appropriate notion of difference. The detailed differential cryptanalysis of DES is based on the difference distributions of each \(S\) box, in order to analyze the round by round evolution of differences when two related plaintexts are encrypted under the same key. The results of the attacks on variants of DES with reduced numbers of round as given in the book are as follows. DES reduced to six rounds can be broken by a chosen plaintext attack in less than 0.3 second on a personal computer using 240 ciphertexts. Its known plaintext variant needs about \(2^{36}\) ciphertexts. DES reduced to eight rounds can be broken by a chosen plaintext attack in less than two minutes on a computer by analyzing \(2^{14}\) ciphertexts. Its conversion to a known plaintext attack needs about \(2^{39}\) ciphertexts. Any reduced variant of DES is breakable by a chosen plaintext attack faster than exhaustive search. The known plaintext variants of the attacks are faster than exhaustive search for up to 14 rounds. An advanced form of differential cryptanalysis can also attack the full 16-round DES. Although this attack is faster than exhaustive key search, it does not endanger present practical applications of DES. The analysis shows however that almost any structural modification of DES leads to a much weaker cryptosystem, thus demonstrating the crucial role of the elements of the design. Beyond DES, differential cryptanalysis is applied to bounded-round versions of the cryptosystems FEAL, Khafre, REDOC-II, LOKI and Lucifer, and to the hash functions Snefru and \(N\)-hash.
- Is the data encryption standard a group? (Results of cycling experiments on DES)
- On immunity against Biham and Shamir's differential cryptanalysis
- Improving the strict avalanche characteristics of cryptographic functions
- New types of cryptanalytic attacks using related keys
- An improvement of Davies' attack on DES
- Pairs and triplets of DES S-boxes
- Provable security against a differential attack
- How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
- On the distribution of characteristics in bijective mappings
- Differential cryptanalysis of Lucifer
- Cryptanalysis of the stream cipher LEX
- Slidex attacks on the Even-Mansour encryption scheme
- Cryptanalysis of SHA-0 and reduced SHA-1
- New slide attacks on almost self-similar ciphers
- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
- Improved see-in-the-middle attacks on AES
- On (-1)-differential uniformity of ternary APN power functions
- An STP-based model toward designing S-boxes with good cryptographic properties
- Counting active S-boxes is not enough
- Pseudo-random number generator based on mixing of three chaotic maps
- Provable security against impossible differential and zero correlation linear cryptanalysis of some Feistel structures
- Differential entropy analysis of the IDEA block cipher
- Quantum differential cryptanalysis
- Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields
- Differential property of \textsc{Present}-like structure
- Efficient slide attacks
- On the group generated by the round functions of translation based ciphers over arbitrary finite fields
- Differential attack on five rounds of the SC2000 block cipher
- On probability of success in linear and differential cryptanalysis
- On two DES implementations secure against differential power analysis in smart-cards
- On construction and (non)existence of \(c\)-(almost) perfect nonlinear functions
- On the \(c\)-differential spectrum of power functions over finite fields
- A novel encryption algorithm using multiple semifield S-boxes based on permutation of symmetric group
- Convergence in differential distributions
- Cryptanalysis of the ``augmented family of cryptographic parity circuits proposed at ISW'97
- Evaluation and cryptanalysis of the Pandaka lightweight cipher
- Polytopic cryptanalysis
- Automatic search of meet-in-the-middle and impossible differential attacks
- New insights on AES-like SPN ciphers
- Formalization of the data encryption standard
- Differential Cryptanalysis of Keccak Variants
- Cryptographic analysis of all 4 4-bit s-boxes
- Practical attack on the full MMB block cipher
- Some instant- and practical-time related-key attacks on KTANTAN32/48/64
- New insights on impossible differential cryptanalysis
- A homophonic DES
- Format-preserving encryption algorithms using families of tweakable blockciphers
- Cryptanalysis of the full 8.5-round REESSE3+ block cipher
- DES has no per round linear factors
- Improved Differential Cryptanalysis of CAST-128 and CAST-256
- Impossible differentials of SPN ciphers
- LBlock: a lightweight block cipher
- Differential cryptanalysis of Q
- Differential-multiple linear cryptanalysis
- Hill climbing algorithms and Trivium
- On the Diffusion of Generalized Feistel Structures Regarding Differential and Linear Cryptanalysis
- Mars attacks! revisited: differential attack on 12 rounds of the MARS core and defeating the complex MARS key-schedule
- On related-key attacks and KASUMI: the case of A5/3
- Related-Key Cryptanalysis of Midori
- Pseudo-random bit generator based on multi-modal maps
- Randomizing encryption mode
- An analysis of international data encryption algorithm(IDEA) security against differential cryptanalysis
- Dynamic extended DES
- Amplifying Side-Channel Attacks with Techniques from Block Cipher Cryptanalysis
- SEA: A Scalable Encryption Algorithm for Small Embedded Applications
- Improved differential attacks on RC5
- Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
- Breaking Littlewood's cipher
- $\textnormal{\textsc{TWINE}}$: A Lightweight Block Cipher for Multiple Platforms
- Analysis of Grain’s Initialization Algorithm
- Capability of evolutionary cryptosystems against differential cryptanalysis
- Methods for Linear and Differential Cryptanalysis of Elastic Block Ciphers
- Cryptanalysis of Reduced-Round SMS4 Block Cipher
- A Unified Approach to Related-Key Attacks
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
- A Five-Round Algebraic Property of the Advanced Encryption Standard
- Distributed differential criptanalysis of FEAL-8
- An Improved Impossible Differential Attack on MISTY1
- A New Attack on the LEX Stream Cipher
- Cryptographic Properties and Application of a Generalized Unbalanced Feistel Network Structure
- The Cryptanalysis of Reduced-Round SMS4
- Algebraic Cryptanalysis of Simplified AES∗
- DES-GENERATED CHECKSUMS FOR ELECTRONIC SIGNATURES
- scientific article; zbMATH DE number 3952651 (Why is no real title available?)
- scientific article; zbMATH DE number 3972781 (Why is no real title available?)
- Differential cryptanalysis of Feal and N-Hash
- Markov ciphers and differential cryptanalysis
- From differential cryptanalysis to ciphertext-only attacks
- Cryptanalysis of SPEED
- scientific article; zbMATH DE number 503238 (Why is no real title available?)
- scientific article; zbMATH DE number 503328 (Why is no real title available?)
- scientific article; zbMATH DE number 697798 (Why is no real title available?)
- scientific article; zbMATH DE number 708826 (Why is no real title available?)
- scientific article; zbMATH DE number 708827 (Why is no real title available?)
- scientific article; zbMATH DE number 708833 (Why is no real title available?)
- scientific article; zbMATH DE number 721905 (Why is no real title available?)
- Differential cryptanalysis of Lucifer
- Cryptanalysis of the CFB mode of the DES with a reduced number of rounds
- DESV-1: A variation of the data encryption standard (DES)
- On construction of involutory MDS matrices from Vandermonde matrices in \(\mathrm{GF}(2^q)\)
This page was built for publication: Differential cryptanalysis of the Data Encryption Standard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136298)