Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 368-383 |
| Number of pages | 16 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3557 |
| Publication status | Published - 2005 Oct 17 |
| Event | 12th International Workshop on Fast Software Encryption. FSE 2005 - Paris, France Duration: 2005 Feb 21 → 2005 Feb 23 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
Hong, S., Kim, J., Lee, S., & Preneel, B. (2005). Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192. Lecture Notes in Computer Science, 3557, 368-383.