Sciweavers

63 search results - page 1 / 13
» Attacking the Knudsen-Preneel Compression Functions
Sort
View
59
Voted
FSE
2010
Springer
132views Cryptology» more  FSE 2010»
15 years 2 months ago
Attacking the Knudsen-Preneel Compression Functions
Onur Özen, Thomas Shrimpton, Martijn Stam
FSE
2006
Springer
107views Cryptology» more  FSE 2006»
15 years 1 months ago
Some Plausible Constructions of Double-Block-Length Hash Functions
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either...
Shoichi Hirose
FSE
2009
Springer
148views Cryptology» more  FSE 2009»
15 years 27 days ago
Cryptanalysis of the LAKE Hash Family
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitiv...
Alex Biryukov, Praveen Gauravaram, Jian Guo, Dmitr...
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
15 years 1 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