Multi-block collisions in hash functions based on 3C and 3C+ enhancements of the Merkle-Damgård construction

5Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

At the ACISP 2006 conference Praveen Gauravaram et al [2] proposed 3C and 3C+ constructions as enhancements of the Merkle-Damgård construction of cryptographic hash functions. They conjectured these constructions improved multi-block collision resistance of the hash functions. In this paper we show that the recently found collision attack on MD5 can be easily extended to the 3C and 3C+ constructions based on the MD5 compression function. In fact we show that if an algorithm satisfying some mild assumptions can find multi-block collisions for the Merkle-Damgård construction then it can be easily modified to find multi-block collisions for the 3C and 3C+ constructions based on the same compression function. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Joščák, D., & Tůma, J. (2006). Multi-block collisions in hash functions based on 3C and 3C+ enhancements of the Merkle-Damgård construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4296 LNCS, pp. 257–266). Springer Verlag. https://doi.org/10.1007/11927587_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free