A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An Analysis of the Blockcipher-Based Hash Functions from PGV
2010
Journal of Cryptology
Preneel, Govaerts, and Vandewalle (1993) considered the 64 most basic ways to construct a hash function H : {0, 1} * → {0, 1} n from a blockcipher E: {0, 1} n ×{0, 1} n → {0, 1} n . They regarded 12 of these 64 schemes as secure, though no proofs or formal claims were given. Here we provide a proof-based treatment of the PGV schemes. We show that, in the ideal-cipher model, the 12 schemes considered secure by PGV really are secure: we give tight upper and lower bounds on their collision
doi:10.1007/s00145-010-9071-0
fatcat:mnuhcz7qznet3bnz7gx4afwfdm