At ASIACRYPT'06, Chang et al. analyzed the indifferentiability of some popular hash
functions based on block ciphers, namely, the twenty collision resistant PGV, the MDC2 and …

Understanding what construction strategy has a chance to be a good hash function is
extremely important nowadays. In TCC'04, Maurer et al.[13] introduced the notion of …

Abstract Preneel et al.(Crypto 1993) assessed 64 possible ways to construct a compression
functions out of a blockcipher. They conjectured that 12 out of these 64 so-called PGV …

In [1] it was proved that 20 out of 64 PGV-hash functions [2] based on block cipher are
collision resistant and one-way-secure in black-box model of the underlying block cipher …

In [1] it was proved that 20 of 64 PGV hash functions based on block cipher are collision-
resistant and one-way in the black-box model of the underlying block cipher. Here, we …

In the recent years, several hash constructions have been introduced that aim at achieving
enhanced security margins by strengthening the Merkle-Damgård mode. However, their …

Abstract 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 …

The design of cryptographic hash functions is a very complex and failure-prone process. For
this reason, this paper puts forward a completely modular and fault-tolerant approach to the …

In this paper, first we point out some flaws in the existing indifferentiability simulations of the
pf-MD and the NMAC constructions, and provide new differentiable attacks on the hash …

Fix a small nonempty set of blockcipher keys K. We say a blockcipher-based hash function is
highly-efficient if it makes exactly one blockcipher call for each message block hashed, and …