4 search results - page 1 / 1 » A Collision-Resistant Rate-1 Double-Block-Length Hash Functi... |
107
Voted
DAGSTUHL
2007
14 years 11 months ago
2007
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...
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
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...
IMA
2009
Springer
15 years 4 months ago
2009
Springer
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...
FSE
2009
Springer
15 years 10 months ago
2009
Springer
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...