Cryptology ePrint Archive: Report 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.

Category / Keywords: MAC / NMAC, HMAC, Distinguishing Attack, Birthday Attack.

Date: received 23 Nov 2006, last revised 6 Dec 2006

Contact author: pointchang at gmail com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20061206:222545 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]