DES-X: Difference between revisions
No edit summary |
m Reflist using AWB |
||
| Line 13: | Line 13: | ||
However, the effective key size (security) is only increased to 56+64-1-''lb(M)'' = 119 - ''lb(M)'' = ~119 bits, where ''M'' is the number of [[Chosen-plaintext attack|chosen plaintext/ciphertext pairs]] the adversary can obtain, and ''lb'' denotes the [[binary logarithm]]. Moreover, key size drops to 88 bits given 2<sup>32.5</sup> known plaintext and using advanced slide attack. |
However, the effective key size (security) is only increased to 56+64-1-''lb(M)'' = 119 - ''lb(M)'' = ~119 bits, where ''M'' is the number of [[Chosen-plaintext attack|chosen plaintext/ciphertext pairs]] the adversary can obtain, and ''lb'' denotes the [[binary logarithm]]. Moreover, key size drops to 88 bits given 2<sup>32.5</sup> known plaintext and using advanced slide attack. |
||
DES-X also increases the strength of DES against [[differential cryptanalysis]] and [[linear cryptanalysis]], although the improvement is much smaller than in the case of brute force attacks. It is estimated that differential cryptanalysis would require 2<sup>61</sup> chosen plaintexts (vs. 2<sup>47</sup> for DES), while linear cryptanalysis would require 2<sup>60</sup> known plaintexts (vs. 2<sup>43</sup> for DES or 2<sup>61</sup> for DES with independent subkeys<ref>{{cite book|last1=Biham|first1=Eli|last2=Shamir|first2=Adi|title=Di�erential Cryptanalysis of DES-like Cryptosystems|date=July 19, 1990|location=Weizmann Institute of Science|pages=105|accessdate=8 March 2017}}</ref> |
DES-X also increases the strength of DES against [[differential cryptanalysis]] and [[linear cryptanalysis]], although the improvement is much smaller than in the case of brute force attacks. It is estimated that differential cryptanalysis would require 2<sup>61</sup> chosen plaintexts (vs. 2<sup>47</sup> for DES), while linear cryptanalysis would require 2<sup>60</sup> known plaintexts (vs. 2<sup>43</sup> for DES or 2<sup>61</sup> for DES with independent subkeys.<ref>{{cite book|last1=Biham|first1=Eli|last2=Shamir|first2=Adi|title=Di�erential Cryptanalysis of DES-like Cryptosystems|date=July 19, 1990|location=Weizmann Institute of Science|pages=105|accessdate=8 March 2017}}</ref>) Note that with 2<sup>64</sup> plaintexts (known or chosen being the same in this case), DES (or indeed any other [[block cipher]] with a 64 bit [[block size (cryptography)|block size]]) is totally broken via the elementary codebook attack. |
||
==See also== |
==See also== |
||
| Line 21: | Line 21: | ||
==References== |
==References== |
||
{{Reflist}} |
|||
* Joe Kilian and Phillip Rogaway, [http://www.cs.ucdavis.edu/~rogaway/papers/desx.pdf How to protect DES against exhaustive key search](PDF), Advances in Cryptology - Crypto '96, Springer-Verlag (1996), pp. 252–267. |
* Joe Kilian and Phillip Rogaway, [http://www.cs.ucdavis.edu/~rogaway/papers/desx.pdf How to protect DES against exhaustive key search](PDF), Advances in Cryptology - Crypto '96, Springer-Verlag (1996), pp. 252–267. |
||
* P. Rogaway, [http://www.cs.ucdavis.edu/~rogaway/papers/cryptobytes.ps The security of DESX] (PostScript), CryptoBytes '''2'''(2) (Summer 1996). |
* P. Rogaway, [http://www.cs.ucdavis.edu/~rogaway/papers/cryptobytes.ps The security of DESX] (PostScript), CryptoBytes '''2'''(2) (Summer 1996). |
||
Revision as of 20:28, 9 March 2017
In cryptography, DES-X (or DESX) is a variant on the DES (Data Encryption Standard) symmetric-key block cipher intended to increase the complexity of a brute force attack using a technique called key whitening.
The original DES algorithm was specified in 1976 with a 56-bit key size: 256 possibilities for the key. There was criticism that an exhaustive search might be within the capabilities of large governments, particularly the United States' National Security Agency (NSA). One scheme to increase the key size of DES without substantially altering the algorithm was DES-X, proposed by Ron Rivest in May 1984.
The algorithm has been included in RSA Security's BSAFE cryptographic library since the late 1980s.
DES-X augments DES by XORing an extra 64 bits of key (K1) to the plaintext before applying DES, and then XORing another 64 bits of key (K2) after the encryption:
The key size is thereby increased to 56 + (2 × 64) = 184 bits.
However, the effective key size (security) is only increased to 56+64-1-lb(M) = 119 - lb(M) = ~119 bits, where M is the number of chosen plaintext/ciphertext pairs the adversary can obtain, and lb denotes the binary logarithm. Moreover, key size drops to 88 bits given 232.5 known plaintext and using advanced slide attack.
DES-X also increases the strength of DES against differential cryptanalysis and linear cryptanalysis, although the improvement is much smaller than in the case of brute force attacks. It is estimated that differential cryptanalysis would require 261 chosen plaintexts (vs. 247 for DES), while linear cryptanalysis would require 260 known plaintexts (vs. 243 for DES or 261 for DES with independent subkeys.[1]) Note that with 264 plaintexts (known or chosen being the same in this case), DES (or indeed any other block cipher with a 64 bit block size) is totally broken via the elementary codebook attack.
See also
References
- Joe Kilian and Phillip Rogaway, How to protect DES against exhaustive key search(PDF), Advances in Cryptology - Crypto '96, Springer-Verlag (1996), pp. 252–267.
- P. Rogaway, The security of DESX (PostScript), CryptoBytes 2(2) (Summer 1996).
- A. Biryukov and D. Wagner, Advanced Slide Attacks, Eurocrypt 2000, Springer-Verlag (2000), pp. 589–606.
