Fix a small, non-empty set of blockcipher keys \mathcalK. We say a blockcipher-based hash
function is highly-efficient if it makes exactly one blockcipher call for each message block …

Abstract The Ideal-Cipher Model of a blockcipher is a well-known and widely-used model
dating back to Shannon [25] and has seen frequent use in proving the security of various …

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 …

Abstract Preneel, Govaerts, and Vandewalle [6] considered the 64 most basic ways to
construct a hash function H:(0, 1)*→(0, 1) n from a block cipher E:(0, 1) n×(0, 10 n→(0, 1) n …

We propose a family of compression functions built from fixed-key blockciphers and
investigate their collision and preimage security in the ideal-cipher model. The constructions …

The most common way of constructing a hash function (eg, SHA-1) is to iterate a
compression function on the input message. The compression function is usually designed …

This work deals with methods to construct a hash function containing a compression function
that is built from a block cipher. There are many schemes to turn a block cipher into a …

In this paper, we describe Whirlpool, which is a block-cipher-based secure hash function.
Whirlpool produces a hash code of 512 bits for an input message of maximum length less …

We present a new hash-function, which provides 2n-bit hash-results, using any n-bit
symmetric block cipher algorithm. This hash-function can be considered as a extension of an …

The design of secure compression functions is of vital importance to hash function
development. In this paper we consider the problem of combining smaller trusted …