This paper introduces a new framework and a generalization of the various flavors of related-key attacks. The new framework allows for combining all the previous related-key attacks into a complex, but much more powerful attack. The new attack is independent of the number of rounds of the cipher. This property holds even when the round functions of the cipher use different subkeys. The strength of our new method is demonstrated by an attack on 4r-round IDEA, for any r. This attack is the first attack on a widely deployed block cipher which is independent of the number of rounds. The variant of the attack with r∈=∈2 is the first known attack on 8-round IDEA. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Biham, E., Dunkelman, O., & Keller, N. (2008). A unified approach to related-key attacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5086 LNCS, pp. 73–96). https://doi.org/10.1007/978-3-540-71039-4_5
Mendeley helps you to discover research relevant for your work.