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
Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound
Alexander Moch,Eik List +1 more
TL;DR: The combination of universal hashing and encryption is a fundamental paradigm for the construction of symmetric-key MACs, and recent proposals that addressed them, initiated by Cogliati et al.
À la faculté informatique et communications laboratoire de sécurité et de cryptographie programme doctoral en informatique, communications et information
TL;DR: This thesis analyzes and proposes optimal SAS-based message authen-tication protocols and shows how to construct optimal SAS-basedauthenticated key agreements, which enables any group of users to agree on ashared secret key.
Dissertation
MAC Constructions: Security Bounds and Distinguishing Attacks
TL;DR: A simple and improved security analysis of PMAC, a Parallelizable MAC (Message Authentication Code) defined over arbitrary messages, shows that the advantage for any distinguishing attack for n–bit PMAC based on a random function is bounded by O( 2n ), where σ is the total number of blocks in all q queries made by the attacker.
Journal ArticleDOI
Authentication of variable length messages in quantum key distribution
TL;DR: In this paper , the authors proposed using Polynomial Hash and its variants for authentication of variable length messages in QKD protocols, and proved that each variant gives an ε-almost-Δ-universal family of hash functions.
Book ChapterDOI
Crypto topics and applications II
TL;DR: This chapter covers secret sharing, threshold cryptography, signature schemes, and finally quantum key distribution and quantum cryptography, which is a relatively recently studied area of cryptography.
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.