We consider the security of message authentication code (MAC) algorithms, and the construction of MACs from fast hash functions. A new forgery attack applicable to all iterated MAC algorithms is described, the first known such attack requiring fewer operations than exhaustive key search. Existing methods for constructing MACs from hash functions, including the secret prefix, secret suffix, and envelope methods, are shown to be unsatisfactory. Motivated by the absence of a secure, fast MAC algorithm not based on encryption, a new generic construction (MDx-MAC) is proposed for transforming any secure hash function of the MD4-family into a secure MAC of equal or smaller bitlength and comparable speed.

Additional Metadata
Persistent URL dx.doi.org/10.1007/3-540-44750-4_1
Series Lecture Notes in Computer Science
Preneel, B. (Bart), & Van Oorschot, P. (1995). MDx-MAC and building fast MACs from hash functions. In Lecture Notes in Computer Science. doi:10.1007/3-540-44750-4_1