Skip to main content

Related Concepts

Block Ciphers; Feistel Cipher; Slide Attack

Definition

DES-X is a 64-bit block cipher with a \(2 \times 64 + 56 = 184\)-bit key, which is a simple extension of DES (Data Encryption Standard).

Background

The construction was suggested by Rivest in 1984 in order to overcome the problem of the short 56-bit key-size which made the cipher vulnerable to exhaustive key search attack. The idea is just to XOR a secret 64-bit key K1 to the input of DES and to XOR another 64-bit secret key K2 to the output of DES: \(C = K2 \oplus {\mathit{DES}}_{K}(P \oplus K1)\). The keys K1, K2 are called whitening keys and they became a popular element of modern cipher design. The construction itself goes back to the work of Shannon [6, p. 713], who suggested the use of a fixed mixing permutation whose input and output are masked by the secret keys. This construction has been shown to have provable security by Even–Mansour [2] if the underlying permutation is pseudorandom(i.e.,...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Biryukov A, Wagner D (2000) Advanced slide attacks. In: Preneel B (ed) Advances in cryptology – Eurocrypt 2000. Lecture notes in computer science, vol 1807. Springer, Berlin, pp 589–606

    Google Scholar 

  2. Even S, Mansour Y (1997) A construction of a cipher from a single pseudorandom permutation. J Cryptol 10(3):151–161

    MATH  MathSciNet  Google Scholar 

  3. Kaliski B, Robshaw M (1996) Multiple encryption: Weighing security and performance. Dr. Dobb’s J 243(1):123–127

    Google Scholar 

  4. Kelsey J, Schneier B, Wagner D (1997) Related-key cryptanalysis of 3-WAY, Biham-DES, CAST, DES-X, NewDES, RC2, and TEA. In: Han Y, Okamoto T, Qing S (eds) Proceedings of ICICS. Lecture notes in computer science, vol 1334. Springer, Berlin, pp 233–246

    Google Scholar 

  5. Kilian J, Rogaway P (1996) How to protect against exhaustive key search. In: Koblitz N (ed) Advances in cryptology – crypto’96. Lecture notes in computer science, vol 1109. Springer, Berlin, pp 252–267

    Google Scholar 

  6. Shannon C (1949) Communication theory of secrecy systems. A declassified report from 1945. Bell Syst Tech J (28): 656–715

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Biryukov, A. (2011). DES-X (or DESX). In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_570

Download citation

Publish with us

Policies and ethics