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
A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs
TL;DR: A method for constructing optimally universal hash families and equivalently RBIBDs is introduced and it is shown that the k-MAXCUT algorithm can be implemented such that it has a polynomial running time, in the case that the number of vertices and k are powers of the same prime.
On the robustness of information-theoretic authentication in quantum cryptography
TL;DR: Arbekov and Molotkov as discussed by the authors provided a security proof of information-theoretic authentication in quantum cryptography using ǫ-ASU2 hash functions, which can also be used for key agrrement in in networks with trusted nodes.
Posted Content
On an almost-universal hash function family with applications to authentication and secrecy codes.
TL;DR: In this article, the authors define the MMH∗ family and define MMH ∗ := {gx : Zp → Zp | x ∈ Zp}, where gx(m) := m · x (mod p) = k ∑
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.