How to Protect DES Against Exhaustive Key Search

作者: Joe Kilian , Phillip Rogaway

DOI: 10.1007/3-540-68697-5_20

关键词:

摘要: The block cipher DESX is defined by DESXk.k1.ka(x) = k2 ⊕ DESk(k1 x), where denotes bitwise exclusive-or. This construction was first suggested Ron Rivest as a computationally-cheap way to protect DES against exhaustive key-search attacks. paper proves, in formal model, that the sound. We show that, when F an idealized cipher, FXk.k1.k2(x)= K2 Fk(k1 x) substantially more resistant key search than F. In fact, our analysis says FX has effective length of at least ϰ+n - 1 lg m bits, ϰ, F, n Iength, and bounds number (x, FXk(x)) pairs adversary can obtain.

参考文章(13)
Shimon Even, Yishay Mansour, A Construction of a Cioher From a Single Pseudorandom Permutation international cryptology conference. pp. 210- 224 ,(1991) , 10.1007/3-540-57332-1_17
Mitsuru Matsui, The First Experimental Cryptanalysis of the Data Encryption Standard international cryptology conference. pp. 1- 11 ,(1994) , 10.1007/3-540-48658-5_1
Eli Biham, Alex Biryukov, How to Strengthen DES Using Existing Hardware international cryptology conference. pp. 398- 412 ,(1994) , 10.1007/BFB0000451
W. Diffie, M.E. Hellman, Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard Computer. ,vol. 10, pp. 74- 84 ,(1977) , 10.1109/C-M.1977.217750
Paul C. van Oorschot, Michael J. Wiener, Parallel Collision Search with Cryptanalytic Applications Journal of Cryptology. ,vol. 12, pp. 1- 28 ,(1999) , 10.1007/PL00003816
Shimon Even, Yishay Mansour, A construction of a cipher from a single pseudorandom permutation Journal of Cryptology. ,vol. 10, pp. 151- 161 ,(1997) , 10.1007/S001459900025
C. E. Shannon, Communication theory of secrecy systems Bell System Technical Journal. ,vol. 28, pp. 656- 715 ,(1949) , 10.1002/J.1538-7305.1949.TB00928.X
Joan Daemen, Limitations of the Even-Mansour Construction international cryptology conference. pp. 495- 498 ,(1991) , 10.1007/3-540-57332-1_46