Publication: Research - peer-review › Conference article – Annual report year: 2011
At Eurocrypt 2001, Biryukov and Shamir investigated the security of AES-like ciphers where the substitutions and affine transformations are all key-dependent and successfully cryptanalysed two and a half rounds. This paper considers PRESENT-like ciphers in a similar manner. We focus on the settings where the S-boxes are key dependent, and repeated for every round. We break one particular variant which was proposed in 2009 with practical complexity in a chosen plaintext/chosen ciphertext scenario. Extrapolating these results suggests that up to 28 rounds of such ciphers can be broken. Furthermore, we outline how our attack strategy can be applied to an extreme case where the S-boxes are chosen uniformly at random for each round and where the bit permutation is secret as well. © 2011 Springer-Verlag.
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Workshop||18th International Workshop on Fast Software Encryption|
|Period||14-02-11 → 16-02-11|
|Citations||Web of Science® Times Cited: No match on DOI|
- PRESENT, Block cipher, Differential cryptanalysis, Symmetric key
Loading map data...