SHA-1 Collisions for Meaningful Messages

Posted by ryuzaki0 on Sunday August 27, 2006 @01:44AM from the well-this-isn't-very-helpful dept.

mrogers writes "Following on the heels of last year's collision search attack against SHA-1, researchers at the Crypto 2006 conference have announced a new attack that allows the attacker to choose part of the colliding messages. "Using the new method, it is possible, for example, to produce two HTML documents with a long nonsense part after the closing </html> tag, which, despite slight differences in the HTML part, thanks to the adapted appendage have the same hash value." A similar attack against MD5 was announced last year."

1 of 128 comments (clear)

Min score:

Reason:

Sort:

Add size of file by yaminb · 2006-08-27 04:41 · Score: 1, Redundant

I can never quite figure out why the MD5 and SHA and all these other algorithms don't include the original message size as part of their hash. This would eliminate all attack vectors that stem from adding or deleting information from a file. But I guess that's too simple a solution for these mathematicians.