A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
[chapter]
1996
Lecture Notes in Computer Science
Meet-in-the-middle aaacks, where problems and the secrets being sought are decomposed into two pieces, have many applications in cryptanalysis. A well-known such attack on double-DES requires 256 time and memory; a naive key search would take 211' time. However, when the attacker is limited to a practical amount of memory, the time savings are much less dramatic. For n the cardinality of the space that each half of the secret is chosen from (n=256 for double-DES), and w the number of words of
doi:10.1007/3-540-68697-5_18
fatcat:myzu5vfpwbfdhc3saexjnycx2m