| H. Dobbertin. Cryptanalysis of MD4. Lecture Notes in Computer Science, 1039:53--69, 1996. Fast Software Encryption Workshop. |
....MD5, and SHA 1 [23] use a one way function to compute a large number (128 or 160 bits) from a block of data. Any modification in the input data will cause the resulting hash value to change. While it is possible to find two sets of input data that will result in the same MD4 hash (weak collision) [8], there is still no known way to produce a second input that hashes to the same value as a given first input. MD5 and SHA are variations on MD4 for which it is currently believed NP hard to find two input texts that result in the same hash value. Certificate object Key object Key object File ....
H. Dobbertin. Cryptanalysis of MD4. Lecture Notes in Computer Science, 1039:53--69, 1996. Fast Software Encryption Workshop.
....produces a 128 bit output, so it is not computationally feasible to produce two messages having the same hash value. The scheme provides diffusion and confusion using three boolean functions. The MD5 hashing algorithm is a strengthened version of MD4 [57] MD4 has been broken by Dobbertin [26]. HAVAL stands for a one way hashing algorithm with a variable length of output. It was designed at the University of Wollongong by Zheng, Pieprzyk and Seberry [85] It compresses a message of an arbitrary length into a digest of either 128, 160, 192, 224 or 256 bits. The security level can be ....
H. Dobbertin. Cryptanalysis of MD4. Proc. Fast Software Encryption Workshop, LNCS Vol. 1039, Springer-Verlag, Berlin, 1996, pp. 71-82.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC