Keying hash functions for message authentication-英文文献.pdfVIP

An abridged version of this pap er app ears in Advances in Cryptology { Crypto 96 Pro ceedings , Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed., Springer-Verlag, 1996. Keying Hash Functions for Message Authentication  y z Mihir Bellare Ran Canetti Hugo Krawczyk June 1996 Abstract The use of cryptographic hash functions like MD5 or SHA for message authentication has b ecome a standard approach in many Internet applications and proto cols. Though very easy to implement, these mechanisms are usually based on ad ho c techniques that lack a sound security analysis. We present new constructions of message authentication schemes based on a cryptographic hash function. Our schemes, NMAC and HMAC , are proven to b e secure as long as the un- derlying hash function has some reasonable cryptographic strengths. Moreover we show, in a quantitative way, that the schemes retain almost all the security of the underlying hash function. In addition our schemes are ecient and practical. Their p erformance is essentially that of the underlying hash function. Moreover they use the hash function (or its compression function) as a black b ox, so that widely available library co de or hardware can b e used to implement them in a simple way, and replaceability of the underlying hash function is easily supp orted.  Department of Computer Science Engineering, Mail Co de 0114, University of California at San Diego, 9500 Gilman Driv