Sciweavers

4 search results - page 1 / 1
» A Collision-Resistant Rate-1 Double-Block-Length Hash Functi...
Sort
View
DAGSTUHL
2007
14 years 9 days ago
A Collision-Resistant Rate-1 Double-Block-Length Hash Function
This paper proposes a construction for collision resistant 2n-bit hash functions, based on n-bit block ciphers with 2n-bit keys. The construction is analysed in the ideal cipher mo...
Stefan Lucks
CRYPTO
2011
Springer
237views Cryptology» more  CRYPTO 2011»
12 years 10 months ago
The Collision Security of Tandem-DM in the Ideal Cipher Model
We prove that Tandem-DM, one of the two “classical” schemes for turning a blockcipher of 2n-bit key into a double block length hash function, has birthday-type collision resist...
Jooyoung Lee, Martijn Stam, John P. Steinberger
IMA
2009
Springer
139views Cryptology» more  IMA 2009»
14 years 5 months ago
Security of Cyclic Double Block Length Hash Functions
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
FSE
2009
Springer
152views Cryptology» more  FSE 2009»
14 years 11 months ago
Blockcipher-Based Hashing Revisited
We revisit the rate-1 blockcipher based hash functions as first studied by Preneel, Govaerts and Vandewalle (Crypto'93) and later extensively analysed by Black, Rogaway and Sh...
Martijn Stam