How to Launch A Birthday Attack Against DES.
Zhengjun Cao · 2008
Abstract We present a birthday attack against DES. It is entirely based on the relationship Li+1 = Ri and the simple key schedule in DES. It requires about 2 16 ciphertexts of the same R16, encrypted by the same key K. We conjecture it has a computational complexity of 248. Since the requirement for the birthday attack is more accessible than that for Differential cryptanalysis, Linear cryptanalysis or Davies ’ attack, it is of more practical significance.