Advertisement

Multi-block Collisions in Hash Functions Based on 3C and 3C+ Enhancements of the Merkle-Damgård Construction

  • Daniel Joščák
  • Jiří Tůma
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4296)

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.

Keywords

hash functions multi-block collision attack 3C and 3C+ constructions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Biham, E., Chen, R., Joux, A., Carribault, P., Lemuet, C., Jalby, W.: Collisions of SHA-0 and Reduced SHA-1. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 36–57. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Gauravaram, P., Millan, W., Dawson, E., Viswanathan, K.: Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol. 4058, pp. 407–420. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Gauravaram, P., Millan, W., Dawson, E., Viswanathan, K.: Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction (extended Version). Information Security Institute (ISI), Queensland University of Technology (QUT), number QUT-ISI-TR-2006-013 (July 2006), http://www.isi.qut.edu.au/research/publications/technical/qut-isi-tr-2006-013.pdf
  4. 4.
    Klima, V.: Tunnels in Hash Functions: MD5 Collisions Within a Minute, Cryptology ePrint Archive: Report 105/2006, http://eprint.iacr.org/2006/105
  5. 5.
    Liang, J., Lai, X.: Improved collision attack on hash function MD5, Cryptology ePrint Archive: Report 425/2005, http://eprint.iacr.org/2005/425
  6. 6.
    Yajima, J., Shimoyama, T.: Wangs sufficient conditions of MD5 are not sufficient, Cryptology ePrint Archive: Report 263/2005, http://eprint.iacr.org/2005/263
  7. 7.
    Wang, X., Feng, D., Lai, X., Yu, H.: Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptology ePrint Archive, Report 2004 199 (2004), http://eprint.iacr.org/2004/199
  8. 8.
    Wang, X., Yin, Y.L., Yu, H.: Efficient collision search attacks on SHA-0. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 1–16. Springer, Heidelberg (2005)Google Scholar
  9. 9.
    Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 17–36. Springer, Heidelberg (2005)Google Scholar
  10. 10.
    Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19–35. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Daniel Joščák
    • 1
  • Jiří Tůma
    • 1
  1. 1.Faculty of Mathematics and Physics, Department of AlgebraCharles University in PraguePrague 8Czech Republic

Personalised recommendations