International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: FRMAC, a Fast Randomized Message Authentication Code

Authors:
√Čliane Jaulmes
Reynald Lercier
Download:
URL: http://eprint.iacr.org/2004/166
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2004-12138,
  title={FRMAC, a Fast Randomized Message Authentication Code},
  booktitle={IACR Eprint archive},
  keywords={secret-key cryptography / message authentication codes},
  url={http://eprint.iacr.org/2004/166},
  note={ reynald.lercier@m4x.org 12611 received 12 Jul 2004},
  author={√Čliane Jaulmes and Reynald Lercier},
  year=2004
}