Sciweavers

69 search results - page 3 / 14
» Attacking Reduced Round SHA-256
Sort
View
FSE
2000
Springer
107views Cryptology» more  FSE 2000»
13 years 11 months ago
Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent
Abstract. We introduce a new cryptanalytic technique based on Wagner's boomerang and inside-out attacks. We first describe this new attack in terms of the original boomerang a...
John Kelsey, Tadayoshi Kohno, Bruce Schneier
AFRICACRYPT
2011
Springer
12 years 11 months ago
Really Fast Syndrome-Based Hashing
Abstract. The FSB (fast syndrome-based) hash function was submitted to the SHA-3 competition by Augot, Finiasz, Gaborit, Manuel, and Sendrier in 2008, after preliminary designs pro...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
AES
2004
Springer
204views Cryptology» more  AES 2004»
14 years 26 days ago
The Boomerang Attack on 5 and 6-Round Reduced AES
In this note we study security of 128-bit key 10-round AES against the boomerang attack. We show attacks on AES reduced to 5 and 6 rounds, much faster than the exhaustive key searc...
Alex Biryukov
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
13 years 11 months ago
Collisions and Near-Collisions for Reduced-Round Tiger
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. Another attack generates pseudo-ne...
John Kelsey, Stefan Lucks
ASIACRYPT
2010
Springer
13 years 5 months ago
Improved Single-Key Attacks on 8-Round AES-192 and AES-256
Abstract. AES is the most widely used block cipher today, and its security is one of the most important issues in cryptanalysis. After 13 years of analysis, related-key attacks wer...
Orr Dunkelman, Nathan Keller, Adi Shamir