Improved meet-in-the-middle attacks on reduced-round DES

Authors:
Orr Dunkelman;Gautham Sekar;Bart Preneel
Affiliations:
Katholieke Universiteit Leuven, Department of Electrical Engineering ESAT/SCD-COSIC, Leuven-Heverlee, Belgium;Katholieke Universiteit Leuven, Department of Electrical Engineering ESAT/SCD-COSIC, Leuven-Heverlee, Belgium;Katholieke Universiteit Leuven, Department of Electrical Engineering ESAT/SCD-COSIC, Leuven-Heverlee, Belgium
Venue:
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Year:
2007

Citing 10
Cited 6

Cryptanalysis of DES with a reduced number of rounds

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
On the security of DES

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Differential cryptanalysis of the data encryption standard

Differential cryptanalysis of the data encryption standard
Linear cryptanalysis method for DES cipher

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Cracking DES: Secrets of Encryption Research, Wiretap Politics and Chip Design

Cracking DES: Secrets of Encryption Research, Wiretap Politics and Chip Design
Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard

Computer
New improvements of davies-murphy cryptanalysis

ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Breaking ciphers with COPACOBANA –a cost-optimized parallel code breaker

CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
New lightweight DES variants

FSE'07 Proceedings of the 14th international conference on Fast Software Encryption

Cryptanalysis of CTC2

CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
A 3-subset meet-in-the-middle attack: cryptanalysis of the lightweight block cipher KTANTAN

SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Meet-in-the-middle attacks on reduced-round XTEA

CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
A single-key attack on the full GOST block cipher

FSE'11 Proceedings of the 18th international conference on Fast software encryption
Biclique cryptanalysis of the full AES

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Narrow-Bicliques: cryptanalysis of full IDEA

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Data Encryption Standard (DES) is a 64-bit block cipher. Despite its short key size of 56 bits, DES continues to be used to protect financial transactions valued at billions of Euros. In this paper, we investigate the strength of DES against attacks that use a limited number of plaintexts and ciphertexts. By mounting meet-in-the-middle attacks on reduced-round DES, we find that up to 6-round DES is susceptible to this kind of attacks. The results of this paper lead to a better understanding on the way DES can be used.