We present the first automatic search algorithms for the best related-key differential characteristics in DES-like ciphers. We show that instead of brute-forcing the space of all possible differences in the master key and the plaintext, it is computationally more efficient to try only a reduced set of input-output differences of three consecutive S-box layers. Based on this observation, we propose two search algorithms - the first explores Matsui's approach, while the second is divide-and-conquer technique. Using our algorithms, we find the probabilities (or the upper bounds on the probabilities) of the best related-key characteristics in DES, DESL, and s2DES. © 2011 Springer-Verlag.
CITATION STYLE
Biryukov, A., & Nikolić, I. (2011). Search for related-key differential characteristics in DES-like ciphers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6733 LNCS, pp. 18–34). https://doi.org/10.1007/978-3-642-21702-9_2
Mendeley helps you to discover research relevant for your work.