Sciweavers

Share
ISW
2007
Springer

The Security of Elastic Block Ciphers Against Key-Recovery Attacks

10 years 6 months ago
The Security of Elastic Block Ciphers Against Key-Recovery Attacks
We analyze the security of elastic block ciphers against key-recovery attacks. An elastic version of a fixed-length block cipher is a variable-length block cipher that supports any block size in the range of one to two times the length of the original block. Our method for creating an elastic block cipher involves inserting the round function of the original cipher into a substitution-permutation network. In this paper, we form a polynomial-time reduction between the elastic and original versions of the cipher by exploiting the underlying network structure. We prove that the elastic version of a cipher is secure against a given key-recovery attack if the original cipher is secure against such an attack. Our analysis is based on the general structure of elastic block ciphers (i.e., the network’s structure, the composition methods between rounds in the network and the keying methodology) and is independent of the specific cipher.
Debra L. Cook, Moti Yung, Angelos D. Keromytis
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ISW
Authors Debra L. Cook, Moti Yung, Angelos D. Keromytis
Comments (0)
books