Badger - A Fast and Provably Secure MAC

Martin Boesgaard, Ove Scavenius, Thomas Pedersen, Thomas Christensen, Erik Zenner

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modied 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 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.3 clock cycles per byte on a Pentium III and Pentium 4 processor, respectively. The forgery probability is at most 2^(52.2).
Original languageEnglish
Title of host publicationProceedings ACNS 2005
EditorsJohn Ioannidis, Angelos Keromytis, Moti Yung
Place of PublicationLondon, UK
PublisherSpringer Verlag
Publication date2005
ISBN (Print)3-540-26223-7
Publication statusPublished - 2005
Externally publishedYes
Event3rd Applied Cryptography and Network Security - New York, NY, United States
Duration: 7 Jun 200510 Jun 2005
Conference number: 3


Conference3rd Applied Cryptography and Network Security
Country/TerritoryUnited States
CityNew York, NY
Internet address
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Badger - A Fast and Provably Secure MAC'. Together they form a unique fingerprint.

Cite this