Paper 2006/441 Original: eprint.iacr.org/2006/441 ↗
General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity
Abstract
Kim {\em et al}. \cite{KiBiPrHo06} and Contini {\em et al}. \cite{CoYi06} studied on the security of HMAC and NMAC based on HAVAL, MD4, MD5, SHA-0 and SHA-1. Especially, they considered the distinguishing attacks. However, they did not describe generic distinguishing attacks on NMAC and HMAC. In this paper, we describe the generic distinguishers to distinguish NMAC and HMAC with the birthday attack complexity and we prove the security bound when the underlying compression function is the random oracle.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2006-12-06: last updated
- 2006-12-04: published
- Short URL
- https://ia.cr/2006/441
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/441,
author = {Donghoon Chang and Mridul Nandi},
title = {General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/441},
year = {2006},
url = {https://eprint.iacr.org/2006/441}
}