Paper 2004/319
Badger - A Fast and Provably Secure MAC
Martin Boesgaard, Ove Scavenius, Thomas Pedersen, Thomas Christensen, and Erik Zenner
Abstract
We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modified tree hash that is more efficient than standard tree hash is used and its security is being proven. Furthermore, in order to derive the core hash function of the tree, we use a novel technique for reducing $\Delta$-universal function families to universal families. The resulting MAC is very efficient on standard platforms both for short and long messages. As an example, for a $64$-bit tag, it achieves performances up to 2.2 and 1.2 clock cycles per byte on a Pentium III and Pentium 4 processor, respectively. The forgery probability is at most $2^{-52.2}$.
Note: This paper is a slightly extended version of that presented at ACNS 2005.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. ACNS 2005 (Springer LNCS)
- Keywords
- message authentication codesuniversal hashtreepseudo-random generator
- Contact author(s)
- ez @ cryptico com
- History
- 2005-09-02: last of 4 revisions
- 2004-11-24: received
- See all versions
- Short URL
- https://ia.cr/2004/319
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2004/319,
author = {Martin Boesgaard and Ove Scavenius and Thomas Pedersen and Thomas Christensen and Erik Zenner},
title = {Badger - A Fast and Provably Secure {MAC}},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/319},
year = {2004},
url = {https://eprint.iacr.org/2004/319}
}
