an early paper on the weakness of cryptographic hashes
|
| Author | Content |
|---|---|
| tuxchick Nov 03, 2005 12:15 PM EDT |
By a friend of mine, Valorie Henson- and they laughed at her. They're not laughing now! "An Analysis of Compare-by-hash" Abstract Recent research has produced a new and perhaps dangerous technique for uniquely identifying blocks that I will call compare-by-hash. Using this technique, we decide whether two blocks are identical to each other by comparing their hash values, using a collision-resistant hash such as SHA-1. If the hash values match, we assume the blocks are identical without further ado. Users of compare-by-hash argue that this assumption is warranted because the chance of a hash collision between any two randomly generated blocks is estimated to be many orders of magnitude smaller than the chance of many kinds of hardware errors. Further analysis shows that this approach is not as risk-free as it seems at first glance. http://infohost.nmt.edu/~val/review/hash.html" |
| Koriel Nov 03, 2005 12:30 PM EDT |
Didn't i read somewhere that SHA-1 has a fundemental flaw in it some while ago? Edit: Ignore this post just read the article, I was forgetting i wasn't on Slashdot :) |
Posting in this forum is limited to members of the group: [ForumMods, SITEADMINS, MEMBERS.]
Becoming a member of LXer is easy and free. Join Us!