ALGORITHMIC ASPECTS OF PREIMAGE SEARCH FOR HASH FUNCTIONS ON THE EXAMPLE OF MD5

Authors

  • Антон Михайлович Кудін National technical university ofUkraine «KPI».
  • Богдан Анатолійович Коваленко National technical university ofUkraine «KPI».

DOI:

https://doi.org/10.18372/2410-7840.17.9516

Keywords:

information security, hash function, preimage, collision, differential path, «meet-in-the-middle», MD5, Merkle-Damgard scheme.

Abstract

In this paper some issues of Aoki method for Merkle-Damgard hash functions preimage was considered. Insteadof the original method, which requires several differentialpaths for theoretical attack, we are targeted on generationof large set of high-probability differential paths. Methodsof set of high-probability differential paths generating wassuggested, complexity evaluation for reduced MD5preimage searching was obtained. These resultsdemonstrate weakness of reduced MD5 algorithm, alsothey provide additional constrictions for new hash functionconstructions.

Author Biographies

Антон Михайлович Кудін, National technical university ofUkraine «KPI».

Doctor of Science, Institute of Physicsand Technologies, National technical university ofUkraine «KPI».

Богдан Анатолійович Коваленко, National technical university ofUkraine «KPI».

postgraduate student, Institute ofPhysics and Technologies, National technical university ofUkraine «KPI».

References

Ralph Charles Merkle. Secrecy, authentication, and public key systems. PhD thesis, Stanford, CA, USA, 1979. AAI8001972.

R. Rivest. The MD5 Message-Digest Algorithm, 1992.

Simon Knellwolf and Dmitry Khovratovich. New preimage attacks against reduced sha-1. Cryptology ePrint Archive, Report 2012/440, 2012.

http://eprint.iacr.org/.

Published

2015-11-03

Issue

Section

Articles