BugTraq
SHA-1 broken Feb 16 2005 12:56PM
Gadi Evron (gadi tehila gov il) (5 replies)
Re: SHA-1 broken Feb 17 2005 02:44PM
Jonathan G. Lampe (jonathan lampe standardnetworks com)
Re: SHA-1 broken Feb 17 2005 01:28AM
Steve Friedl (steve unixwiz net)
Re: SHA-1 broken Feb 17 2005 01:25AM
Robert Sussland (robert inkwood org) (1 replies)
Re: SHA-1 broken Feb 17 2005 10:42PM
dullien gmx de (2 replies)
Re: SHA-1 broken Feb 19 2005 05:24PM
Darren Reed (avalon caligula anu edu au) (1 replies)
Re: SHA-1 broken Feb 19 2005 05:41PM
dullien gmx de
Re: SHA-1 broken Feb 19 2005 01:22PM
Tollef Fog Heen (tfheen err no) (1 replies)
Re: SHA-1 broken Feb 20 2005 09:45AM
Denis Jedig (seclists syneticon de)
Re: SHA-1 broken Feb 17 2005 01:02AM
Michael Cordover (michael cordover gmail com) (3 replies)
Re: SHA-1 broken Feb 18 2005 02:22AM
Dan Harkless (bugtraq harkless org)
Re: SHA-1 broken Feb 17 2005 11:32PM
D.J. Capelis (djcapelisp yahoo com) (1 replies)
Re: SHA-1 broken Feb 19 2005 03:37AM
Michael Cordover (michael cordover gmail com)
On this topic, I might actually say that a concatenation of two hashes
is very secure if the two hashes are sufficiently different.

Although MD5 and SHA1 are reasonably similar, let's suppose for a
moment that they use entirely different mechanisms. If this were so
and the crack time for MD5 was 2**50, for SHA1 2**65, then the crack
time for CONCAT(MD5(string), SHA1(string)) would be about 2**115.
This is because you need to find something that colides for both.
This is *far* more difficult and therefore far more collision
resistant. Unfortunately this requires 288 bits - far more than each
of the old hashes. Still, that much memory doesn't tend to be a
problem ;).

Regards,

Michael Cordover

--
http://mine.mjec.net/

[ reply ]
Re: SHA-1 broken Feb 17 2005 10:39PM
dullien gmx de
Re: SHA-1 broken Feb 16 2005 11:27PM
Kent Borg (kentborg borg org)


 

Privacy Statement
Copyright 2010, SecurityFocus