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
Domain mapping method and system
TL;DR: In this article, a method and system for mapping a network domain provides a centralized repository for network information to support network devices, including an intrusion detection system, and a domain mapping device includes an acquisition engine for acquiring network information, hypercube storage for storing network information.
Patent
Network intrusion detection signature analysis using decision graphs
TL;DR: In this paper, the authors proposed a method of detecting signatures representing misuse of a local network by representing known reference signatures having one or more common events with a decision graph having shared nodes.
Journal ArticleDOI
On the security of iterated message authentication codes
Bart Preneel,P. C. van Oorschot +1 more
TL;DR: A new MAC forgery attack applicable to all deterministic iterated MAC algorithms is presented, which requires on the order of 2/sup n/2/ known text-MAC pairs for algorithms with n bits of internal memory, as compared to the best previous general attack which required exhaustive key search.
Book ChapterDOI
On the security of two MAC algorithms
TL;DR: In this article, the security of two message authentication code (MAC) algorithms is considered: the MD5-based envelope method (RFC 1828), and the banking standard MAA (ISO 8731-2).
Book ChapterDOI
Parallelizable and Authenticated Online Ciphers
TL;DR: This work proposes the first parallelizable online cipher, COPE, which performs two calls to the underlying block cipher per plaintext block and is fully parallelizable in both encryption and decryption and extends COPE to create COPA, the first Parallelizable, online authenticated cipher with nonce-misuse resistance.
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.