Welcome to the resource topic for 2008/288
Title:
How to Launch A Birthday Attack Against DES
Authors: Zhengjun Cao
Abstract:We present a birthday attack against DES. It is entirely based on the relationship L_{i+1}=R_{i} and the simple key schedule in DES. It requires about 2^{16} ciphertexts of the same R_{16}, encrypted by the same key K. We conjecture it has a computational complexity of 2^{48}. 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.
ePrint: https://eprint.iacr.org/2008/288
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .