New (Two-Track-)MAC based on the two trails of RIPEMD: Efficient, especially on short messages and for frequent Key-Changes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2259, Issue , 2001, Pages 314-324

  Den Boer, Bert ^a   Van Rompay, Bart ^b   Preneel, Bart ^b   Vandewalle, Joos ^b  

^a TNO   (Netherlands)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

MESSAGE AUTHENTICATION CODES; SHORT MESSAGE; UN-KEYED HASH FUNCTIONS;

CRYPTOGRAPHY;

EID: 84949194881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (6)

1. Mihir Bellare, Ran Canetti and Hugo Krawczyk, “Keying hash functions for message authentication,” Proc. Crypto’96, LNCS 1109, Springer-Verlag, 1996, pp 1-15.
2. Hans Dobbertin, Antoon Bosselaers and Bart Preneel, “RIPEMD-160: a strengthened version of RIPEMD,” Fast Software Encryption, LNCS 1039, Springer-Verlag, 1996, pp 71-82.
3. NESSIE Project – New European Schemes for Signatures, Integrity and Encryption – home page: http://cryptonessie.org.
4. Bart Preneel and Paul van Oorschot, “MDx-MAC and building fast MAC’s from hash functions,” Proc. Crypto’95, LNCS 963, Springer-Verlag, 1995, pp 1-14.
5. Bart Preneel and Paul van Oorschot, “On the security of two MAC algorithms,” Proc. Eurocrypt’96, LNCS 1070, Springer-Verlag, 1996, pp 19-32.
6. Gene Tsudik, “Message authentication with one-way hash functions,” ACM Computer Communications Review, Vol. 22, No. 5, 1992, pp. 29-38.