International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity

Authors:
Donghoon Chang
Mridul Nandi
Download:
URL: http://eprint.iacr.org/2006/441
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2006-21932,
  title={General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity},
  booktitle={IACR Eprint archive},
  keywords={MAC / NMAC, HMAC, Distinguishing Attack, Birthday Attack.},
  url={http://eprint.iacr.org/2006/441},
  note={ pointchang@gmail.com 13488 received 23 Nov 2006, last revised 6 Dec 2006},
  author={Donghoon Chang and Mridul Nandi},
  year=2006
}