3 ms·
There are humorous examples from the past, where there 20 PDF files prepared in advance, all having the same MD5 hash, where each one of them says "We hereby pr
by beagle3 14y ago
There are humorous examples from the past, where there 20 PDF files prepared in advance, all having the same MD5 hash, where each one of them says "We hereby predict X is going to be president".
You publish the hash in advance, and after elections you only publish the right PDF file, thereby "proving" your clairvoyance.
More seriously: You can get a notary (e.g. Microsoft Authenticode) to sign one file, and then provide another with the same hash.
For now, it only helps you with planned fraud, not after-the-fact forgery.
- zdw 14y agoAh, got it. Didn't think about the "controlling both copies" subterfuge, but that makes a lot of sense.
- VMG 14y agomd5? I think you mean md4. There are few examples of md5 collisions: http://stackoverflow.com/a/1224282/92493 http://stackoverflow.com/a/1224282/92493
- gjm11 14y agoNo, MD5. See, e.g., http://www.win.tue.nl/hashclash/Nostradamus/ http://www.win.tue.nl/hashclash/Nostradamus/
- mikeash 14y agoFrom the link at the bottom of that page to a collision finder program: > It takes about half an hour on average on a standard PC to find a collision. That's not a whole lot of time. Edit: it really does work, too: $ md5 msg[12].txt MD5 (msg1.txt) = bd1ba334fdd5bf3836b9b8c4bfebae16 MD5 (msg2.txt) = bd1ba334fdd5bf3836b9b8c4bfebae16 $ openssl sha1 msg[12].txt SHA1(msg1.txt)= fd5bb8044dc51ab2deef608fabf3b7dcb7a84c17 SHA1(msg2.txt)= 7d490719b22f9a0e365e4fab4e3ab551b4a8898e Took about half an hour on my MacBook Air, just as promised.