Bucket Hashing and its Application to Fast Message Authentication
Phillip Rogaway
- pp 29-42
Reads0
Chats0
TLDR
A new technique for generating a message authentication code (MAC) using a simple metaphor to (noncryptographically) hash a string x, cast each of its words into a small number of buckets, and collect up all the buckets' contents.Abstract:
We introduce a new technique for generating a message authentication code (MAC). At its center is a simple metaphor: to (noncryptographically) hash a string x, cast each of its words into a small number of buckets; xor the contents of each bucket; then collect up all the buckets' contents. Used in the context of Wegman-Carter authentication, this style of hash function provides the fastest known approach to software message authentication.read more
Citations
More filters
Book ChapterDOI
Incremental Cryptography Revisited: PRFs, Nonces and Modular Design
TL;DR: The first definitions and constructions for incremental pseudo-random functions (IPRFs) are given, and the movement from randomized or stateful schemes to nonce based ones, and from UF (unforgeability) to PRF security, are brought up to speed with the broader field of symmetric cryptography itself.
Proceedings ArticleDOI
MISRs for Fast Authentication of Long Messages
R.S. Katti,Rucha Sule +1 more
TL;DR: This paper uses a pseudorandom function along with an MISR to generate a message authentication code (MAC) that is provably secure and compares the software and hardware implementation of the MAC with other schemes.
Journal ArticleDOI
Towards a Framework for Supporting Unconditionally Secure Authentication Services within E-Government Infrastructures
TL;DR: The work highlights the basic requirements for a general framework that facilitates the inclusion of unconditionally secure authentication services within the security infrastructure.
Posted Content
Badger - A Fast and Provably Secure MAC.
TL;DR: Badger as mentioned in this paper is a fast and provably secure MAC based on universal hashing, which achieves performance up to 2.2 and 1.3 clock cycles per byte on a Pentium III and Pentium 4 processor, respectively.
Posted Content
On almost-universal multilinear modular hashing with composite moduli
TL;DR: Universal hashing, discovered by Carter and Wegman in 1979, has many applications in computer science, for example, in cryptography, randomized algorithms, dictionary data structures etc.
References
More filters
Book
Graph theory with applications
TL;DR: In this paper, the authors present Graph Theory with Applications: Graph theory with applications, a collection of applications of graph theory in the field of Operational Research and Management. Journal of the Operational research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
Journal ArticleDOI
Graph theory with applications (revised edition), by J. A. Bondy and U.S.R. Murty. Pp x, 264. £5·95 paperback. 1977. SBN 0 333 22694 1 (Macmillan)
Proceedings Article
The MD5 Message-Digest Algorithm
TL;DR: This document describes the MD5 message-digest algorithm, which takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input.
Journal ArticleDOI
A digital signature scheme secure against adaptive chosen-message attacks
TL;DR: A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message.