FRMAC, a Fast Randomized Message Authentication Code

Eliane Jaulmes; Reynald Lercier

Paper 2004/166

FRMAC, a Fast Randomized Message Authentication Code

Eliane Jaulmes and Reynald Lercier

Abstract

We revisit the randomized approach followed in the design of the RMAC message authentication code in order to construct a MAC with similar properties, but based on Wegman-Carter's $\varepsilon$-universal hash families instead of a classical CBC chain. This yields a new message authentication code called FRMAC whose security bounds are, as in RMAC, beyond the birthday paradox limit. With efficient hash functions in software, the performance of FRMAC for large messages is similar to those of the fastest previously known schemes. FRMAC can also be more efficient for small messages. Furthermore, due to relaxed requirements about the nonces in the security proof, the implementation of FRMAC in real applications tends to be easier.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: message authentication codes
Contact author(s): reynald lercier @ m4x org
History: 2004-07-14: received
Short URL: https://ia.cr/2004/166
License: CC BY

BibTeX

@misc{cryptoeprint:2004/166,
      author = {Eliane Jaulmes and Reynald Lercier},
      title = {{FRMAC}, a Fast Randomized Message Authentication Code},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/166},
      year = {2004},
      url = {https://eprint.iacr.org/2004/166}
}