<?xml version="1.0" encoding="windows-1252"?>
<node id="386498" title="Re^5: On showing the weakness in the MD5 digest function and getting bitten by scalar context" created="2004-08-27 17:34:50" updated="2005-06-02 20:45:51">
<type id="11">
note</type>
<author id="200155">
iburrell</author>
<data>
<field name="doctext">
You are missing the point of the attack.  One of the main properties of a cryptographic hash is that is hard to FIND a collision.  There are certainly collisions, but with a secure hash function and a large enough size, it is practically impossible to find another input that produces the same hash.   This is very important for many cryptographic protocols. 

&lt;p&gt;
This attack takes finding an MD5 hash collision from  difficult brute force to relatively easy.  This doesn't matter too much for many uses of MD5 where security isn't important.
</field>
<field name="root_node">
386193</field>
<field name="parent_node">
386470</field>
</data>
</node>
