Sciweavers

44 search results - page 3 / 9
» Impossible Boomerang Attack for Block Cipher Structures
Sort
View
AES
2000
Springer
136views Cryptology» more  AES 2000»
13 years 12 months ago
Preliminary Cryptanalysis of Reduced-Round Serpent
Serpent is a 32-round AES block cipher finalist. In this paper we present several attacks on reduced-round variants of Serpent that require less work than exhaustive search. We at...
Tadayoshi Kohno, John Kelsey, Bruce Schneier
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
13 years 9 months ago
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...
SACRYPT
2005
Springer
138views Cryptology» more  SACRYPT 2005»
14 years 29 days ago
On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners
A vast amount of literature on stream ciphers is directed to the cryptanalysis of LFSR-based filters and combiners, resulting in various attack models such as distinguishing attac...
An Braeken, Joseph Lano
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
13 years 9 months ago
Collisions on SHA-0 in One Hour
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
Stéphane Manuel, Thomas Peyrin
EUROCRYPT
2005
Springer
14 years 1 months ago
Related-Key Boomerang and Rectangle Attacks
This paper introduces the related-key boomerang and the related-key rectangle attacks. These new attacks can expand the cryptanalytic toolbox, and can be applied to many block ciph...
Eli Biham, Orr Dunkelman, Nathan Keller