General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity

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

General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity

Abstract. Kim et al. [4] and Contini et al. [3] studied on the security o