|
|
项目主页：http://boinc.banaan.org/hashclash/
Project HashClash
Using techniques from the attack from Wang et al., we are trying to find collisions which are more flexible. More concretely, we will allow the first blocks of two messages to be chosen at will. This attack is in ongoing research, however it is already clear that it requires large scale computational power. Therefore project HashClash was started. Currently you can join HashClash to help us in the first phase of this research, called 'MD5 Birthdaying'. It consists of finding a block with very specific properties, that will help us in later phases. Finding that block on a single Pentium4 3Ghz would take approx. 800 days of 24/7 continous running. We hope by combining the computational powers of many pc's to find this block much faster.
This project is intended as cryptographic research only. We intend to clarify the nature of the vulnerabilities in applications of MD5 that have been opened up by the collision finding methods of Wang et al. At a later stage we also intend to work on collision-finding for SHA-1.
大致意思是在 王小云 等人工作基础上，研究 MD5 算法的碰撞情况。
[ Last edited by Youth on 2006-7-28 at 13:05 ] |
|
发表于 2006-3-16 20:18:24
发表于 2006-3-17 21:18:37
发表于 2006-3-18 19:34:49
