eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20061206:222545 of this paper.
See the latest version.
Paper 2006/441
General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity
Donghoon Chang, Mridul Nandi
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
PS
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- MACNMACHMACDistinguishing AttackBirthday Attack.
- Contact author(s)
- pointchang @ gmail com
- History
- 2006-12-06: last of 2 revisions
- 2006-12-04: received
- See all versions
- Short URL
- https://ia.cr/2006/441
- License
-
CC BY
