On Wed, Nov 16, 2005 at 05:26:05PM -0800, Brent 'Dax' Royal-Gordon wrote: > My understanding is that the best attack on SHA-1 which can find two > plaintexts with the same hash value in 2^63 operations. > [...] > Basically, SHA-1 isn't a problem for us yet, but it's looking weak.
OK. Thanks for quantifying that, I'd missed the numbers. > > I'm getting the feeling that the real lesson is that any hash header > > system we build will require pluggable hash algorithms [...] > > From what I've read, that was one of the conclusions of NIST's recent > hash workshop. I think we've been reading the same blog. :-) -- Chip Salzenberg <[EMAIL PROTECTED]>
