56 search results - page 1 / 12 » Software Performance of Universal Hash Functions |
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toepli...
CCS
2008
ACM
13 years 6 months ago
2008
ACM
We propose a new real-time authentication scheme for memory. As in previous proposals the scheme uses a Merkle tree to guarantee dynamic protection of memory. We use the universal...
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...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
STACS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...