CryptoDB
An Efficient MAC for Short Messages
| Authors: | |
|---|---|
| Download: | |
| Abstract: | HMAC is the internet standard for message authentication. What distinguishes HMAC from other MAC algorithms is that it provides proofs of security assuming that the underlying cryptographic hash (e.g. SHA-1) has some reasonable properties. HMAC is efficient for long messages, however, for short messages the nested construction results in a significant inefficiency. For example to MAC a message shorter than a block, HMAC requires at least two calls to the compression function rather than one. This inefficiency may be particularly high for some applications, like message authentication of signaling messages, where the individual messages may all fit within one or two blocks. Also for TCP/IP traffic it is well known that large number of packets (e.g. acknowledgment) have sizes around 40 bytes which fit within a block of most cryptographic hashes. We propose an enhancement that allows both short and long messages to be message authenticated more efficiently than HMAC while also providing proofs of security. In particular, for a message smaller than a block our MAC only requires one call to the compression function. |
BibTeX
@misc{eprint-2001-11509,
title={An Efficient MAC for Short Messages},
booktitle={IACR Eprint archive},
keywords={secret-key cryptography / message authentication, MAC, HMAC, MD5, SHA-1},
url={http://eprint.iacr.org/2001/097},
note={ sarvar@lucent.com 11640 received 14 Nov 2001},
author={Sarvar Patel},
year=2001
}