143 search results - page 1 / 29 » Hash, Displace, and Compress |
ESA
2009
Springer
13 years 11 months ago
2009
Springer
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 ...
WADS
1999
Springer
13 years 9 months ago
1999
Springer
FSE
1993
Springer
13 years 9 months ago
1993
Springer
Abstract. Dedicated hash functions are cryptographically secure compression functions which are designed specifically for hashing. They intend to form a practical alternative for ...
ASIACRYPT
2005
Springer
13 years 10 months ago
2005
Springer
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...
CAI
2007
Springer
13 years 4 months ago
2007
Springer
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...