Cryptographic hash algorithms such as MD4, MD5, SHA-1, RIPEMD, TIGER, RIPEMD-160 are most widely used because of trust in their security and speed they offer. Since the design paradigm of these fast hash algorithms is ``trial-and-error'', they need to have good cryptanalysis effort.
In this thesis, we have done cryptanalysis of MD4 and MD5. we have shown a new method for obtaining collisions for reduced number of rounds in MD4 and MD5 hash algorithms. We also discussed the possibility of extending the existing attacks to full rounds of MD5.
Full Thesis (PS-gzipped: 175K)