Results 141 to 150 of about 226,366 (162)

Chosen-prefix collisions for MD5 and applications [PDF]

International Journal of Applied Cryptography, 2012
We present a novel, automated way to find differential paths for MD5. Its main application is in the construction of \emph{chosen-prefix collisions}. We have shown how, at an approximate expected cost of $2^{39}$ calls to the MD5 compression function,
Marc Stevens, Arjen K. Lenstra
exaly   +1 more source

Finding Preimages in Full MD5 Faster Than Exhaustive Search

Lecture Notes in Computer Science, 2009
. In this paper, we present the first cryptographic preimage attack on the full MD5 hash function. This attack, with a complexity of 2116.9, generates a pseudo-preimage of MD5 and, with a complexity of 2123.4, generates a preimage of MD5.
Yu Sasaki, Kazumaro Aoki
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Multiple Hashing Using SHA-256 and MD5

Lecture Notes in Electrical Engineering, 2021
Prasad B Honnavalli
exaly  

A novel triazine ring compound (MD568) exerts and effects on lipid metabolism

Biomedicine and Pharmacotherapy, 2018
Weimin Li
exaly  

Research and Improvement of Secure Hash Algorithm Based on MD5

2023
Runan Yang, Shengbiao Cao, You Xue
exaly