The standard technique to attack triple encryption is the meet-in-the-middle attack. In this paper, more efficient attacks are presented. Compared to meet-in-the-middle, our attacks either greatly reduce the number of single encryptions to be done, or somewhat reduce the overall number of steps. Especially, about $2^{108}$ steps of computation are sufficient to break three-key triple DES. If one concentrates on the number of single DES operations and assumes the other operations to be much faster, $2^{90}$ of these are enough. We use this to compare the security of triple DES and DESX.
Dieser Eintrag ist Teil der Universitätsbibliographie.
Search Authors in