A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
Djamal Belazzougui, Fabiano C. Botelho, Martin Die...
Abstract. Dedicated hash functions are cryptographically secure compression functions which are designed specifically for hashing. They intend to form a practical alternative for ...
Abstract. This paper reconsiders the established Merkle-Damg˚ard design principle for iterated hash functions. The internal state size w of an iterated n-bit hash function is trea...
Abstract. The security of iterated hash functions relies on the properties of underlying compression functions. We study highly efficient compression functions based on block ciphe...