vBulletin Search Engine Optimization
| |||||||
| Register | FAQ | Members List | Calendar | Search | Today's Posts | Mark Forums Read |
| ||||
| Dries Schellekens wrote: | | Finding a collision for both MD5 and SHA-1 at the same time is | completely improbable. Finding a collision for SHA-1 was also deemed completely improbable ten years ago. However nowadays the attack seems very probable. My point is, finding a collision for both MD5 and SHA-1 will eventually get accomplished some day. If it was really considered improbable, then I suggest cryptographers stop researching secure hashing algorithms and start using the hash function H(x) = MD5(x) . SHA1(x), where '.' is the concatenation operator. -- Marc Bevand http://epita.fr/~bevand_m Computer Science School EPITA - System, Network and Security Dept. |
| Thread Tools | |
| Display Modes | |
| |