ALGORITHMIC ASPECTS OF PREIMAGE SEARCH FOR HASH FUNCTIONS ON THE EXAMPLE OF MD5
DOI:
https://doi.org/10.18372/2410-7840.17.9516Keywords:
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.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.
Downloads
Published
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.