In this paper we propose a notion of related-key rectangle attack using 4 related keys. It is based on two consecutive related-key differentials which are independent of each other. Using this attack we can break SHACAL-1 with 512-bit keys up to 70 rounds out of 80 rounds and AES with 192-bit keys up to 8 rounds out of 12 rounds, which are faster than exhaustive search. © International Association for Cryptologic Research 2005.
CITATION STYLE
Hong, S., Kim, J., Lee, S., & Preneel, B. (2005). Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192. In Lecture Notes in Computer Science (Vol. 3557, pp. 368–383). Springer Verlag. https://doi.org/10.1007/11502760_25
Mendeley helps you to discover research relevant for your work.