In this paper we design several double length hash functions and study their security properties in the random oracle model. We design a class of double length hash functions (and ...
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...