Securing DES S-boxes against Three Robust Cryptanalysis
Kwangjo Kim, S Park, Daiki Lee · 1995
In this paper, we propose an expanded set of design criteria for the generation of DES-like Sboxes which enable DES being immunized against three known robust cryptanalysis, i.e., differential, Improved Davies' and linear cryptanalysis and we also suggest a set of new 8 DES-like S-boxes generated by our proposed design criteria in order to replace with the current 8 DES S-boxes. The computer simulation leads us to conclude that the breaking complexity of the strengthened DES (we call s 5 DES) by three powerful cryptanalysis is no more efficient than the key-exhaustive search. 1 Introduction Until now, three powerful cryptanalysis have been published to break DES (Data Encryption Standard) [1] more efficiently than the 56-bit key exhaustive search. One is the DC (Differential Cryptanalysis) proposed by Biham and Shamir [2],[4] in 1990. The DC is a kind of chosen plaintext attack in a sense that an attacker has to choose 2 47 plaintexts and their corresponding ciphertexts to find an...