Badger – a fast and provably secure MAC

  • Authors:
  • Martin Boesgaard;Thomas Christensen;Erik Zenner

  • Affiliations:
  • CRYPTICO A/S, Copenhagen, Denmark;CRYPTICO A/S, Copenhagen, Denmark;CRYPTICO A/S, Copenhagen, Denmark

  • Venue:
  • ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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 hashing is used and its security is proven. Furthermore, in order to derive the core hash function of the tree, we use a novel technique for reducing Δ-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.3 clock cycles per byte on a Pentium III and Pentium 4 processor, respectively. The forgery probability is at most 2−−52.2.