66 search results - page 1 / 14 » Universal Hashing and Authentication Codes |
CRYPTO
1995
Springer
13 years 9 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...
CRYPTO
1991
Springer
13 years 9 months ago
1991
Springer
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
FSE
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
FPGA
2004
ACM
13 years 10 months ago
2004
ACM
We present a cryptographic architecture optimization technique called divide-and-concatenate based on two observations: (i) the area of a multiplier and associated data path decre...
JUCS
2008
13 years 5 months ago
2008
Abstract: Message Authentication Code (MAC) algorithms can provide cryptographically secure authentication services. One of the most popular algorithms in commercial