158 search results - page 1 / 32 » Simple Fast Parallel Hashing |
ICALP
1994
Springer
13 years 8 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
CRYPTO
1995
Springer
13 years 8 months ago
1995
Springer
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small numb...
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
JOC
1998
13 years 4 months ago
1998
The security of hash functions based on a block cipher with a block length of m bits and a key length of k bits, where k ≤ m, is considered. New attacks are presented on a large ...
FSE
2008
Springer
13 years 6 months ago
2008
Springer
Hash functions are an important building block in almost all security applications. In the past few years, there have been major advances in the cryptanalysis of hash functions, es...