<?xml version="1.0" encoding="windows-1252"?>
<node id="386546" title="Re^2: On showing the weakness in the MD5 digest function and getting bitten by scalar context" created="2004-08-27 23:28:57" updated="2005-06-02 18:45:16">
<type id="11">
note</type>
<author id="961">
Anonymous Monk</author>
<data>
<field name="doctext">
&lt;blockquote&gt;&lt;i&gt;While it might be amusing to watch people run around in panic over this, I wish they'd stop. They've been told for years that they should avoid MD5; I'm just surprised this discovery wasn't made sooner.&lt;/i&gt;&lt;/blockquote&gt;
Hear, hear.
&lt;blockquote&gt;&lt;i&gt;Also, I'm not sure on this point, but I don't think SHA-512 adds any security over SHA-1. It increases the size of the bitstream, which is useful for some applications, but finding collisions would take the same amount of time.&lt;/i&gt;&lt;/blockquote&gt;
Not sure I follow you here. If the best possible collision-finding attack is brute force, shouldn't a longer output translate directly to more work? Are you suggesting that there is a better-than-brute-force attack against SHA-512? I'd have to say that it seems likely that one will be discovered someday. This MD5 discovery shows how much we still have to learn about constructing hash functions.</field>
<field name="root_node">
386193</field>
<field name="parent_node">
386351</field>
<field name="reputation">
4</field>
</data>
</node>
