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
Patent
System and method for consolidating and sorting event data
TL;DR: In this article, a system for consolidating and sorting event data include a computing platform communicatively coupled to a computer readable medium and a network, where at least one node is mapped into a tree.
Journal Article
Cryptographic primitives for information authentication - state of the art
TL;DR: The state of the art for cryptographic primitives that are used for protecting the authenticity of information are described: cryptographic hash functions and digital signature schemes; the first class can be divided into Manipulation Detection Codes (MDCs) and Message Authentication Codes (or MACs).
Book ChapterDOI
On the Round Security of Symmetric-Key Cryptographic Primitives
Zulfikar Ramzan,Leonid Reyzin +1 more
TL;DR: A new model is put forward for understanding the security of symmetric-key primitives, such as block ciphers, that captures the fact that many such primitives often consist of iterating simpler constructs for a number of rounds, and may provide insight into theSecurity of such designs.
Patent
System and method for selectively authenticating data
TL;DR: In this paper, a high-speed, low-strength authentication mechanism is proposed based on a partial message authentication code, which is applied only to some portion of the message, and significant time can be saved while maintaining acceptable security.
Book ChapterDOI
Universal Hashing and Multiple Authentication
Mustafa Atici,Douglas R. Stinson +1 more
TL;DR: This paper compares several recent universal-hashing based constructions for authentication codes and generalizes the theory of universal hashing in order to accommodate the situation where one would like to authenticate a sequence of messages with the same key.
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.