FSE
1999
Springer
13 years 9 months ago
1999
Springer
FSE
1999
Springer
13 years 9 months ago
1999
Springer
We introduce “mod n cryptanalysis,” a form of partitioning attack that is effective against ciphers which rely on modular addition and bit rotations for their security. We dem...
FSE
1999
Springer
13 years 9 months ago
1999
Springer
FSE
1999
Springer
13 years 9 months ago
1999
Springer
The DES has reached the end of its lifetime due to its too short key length and block length (56 and 64 bits respectively). As we are awaiting the new AES, triple (and double) encr...
FSE
1999
Springer
13 years 9 months ago
1999
Springer
We study the functions from Fm 2 into Fm 2 for odd m which oppose an optimal resistance to linear cryptanalysis. These functions are called almost bent. It is known that almost ben...
FSE
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we evaluate the resistance of the block cipher RC5 against linear cryptanalysis. We describe a known plaintext attack that can break RC5-32 (blocksize 64) with 10 rou...
FSE
1999
Springer
13 years 9 months ago
1999
Springer
Recently a powerful cryptanalytic tool—the slide attack— was introduced [3]. Slide attacks are very successful in breaking iterative ciphers with a high degree of self-similari...
FSE
1999
Springer
13 years 9 months ago
1999
Springer
Whereas a block cipher enciphers messages of some one particular length the blocklength , a variable-input-length cipher takes messages of varying and preferably arbitrary leng...
FSE
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. In this paper we present an attack on a reduced round version of Crypton. The attack is based on the dedicated Square attack. We explain why the attack also works on Cryp...