MemeStreams | MemeStreams Discussion

Create an Account

This page contains all of the posts and discussion on MemeStreams referencing the following web page: Followup on SHA-1 break. You can find discussions on MemeStreams as you surf the web, even if you aren't a MemeStreams member, using the Threads Bookmarklet.

Followup on SHA-1 break
by Decius at 9:51 am EDT, Aug 18, 2004

] Eli Biham announced new results in cryptanalyzing SHA-1,
] including a collision in a reduced-round version of
] SHA-1. The full SHA-1 algorithm does 80 rounds of
] scrambling. At present, Biham and Chen can break
] versions of SHA-1 that use up to about 40 rounds, and
] they seem confident that their attacks can be extended to
] more rounds. This is a significant advance, but it's
] well short of the dramatic full break that was rumored.
]
] Where does this leave us? MD5 is fatally wounded; its
] use will be phased out. SHA-1 is still alive but the
] vultures are circling. A gradual transition away from
] SHA-1 will now start. The first stage will be a debate
] about alternatives, leading (I hope) to a consensus among
] practicing cryptographers about what the substitute will
] be.

Answer, not a 5 alarm fire, but if you write or maintain cryptography code you can still expect some work coming up.

RE: Followup on SHA-1 break
by jlang at 6:33 pm EDT, Aug 20, 2004

Decius wrote:
] ] Where does this leave us? MD5 is fatally wounded; its
] ] use will be phased out. SHA-1 is still alive but the
] ] vultures are circling. A gradual transition away from
] ] SHA-1 will now start. The first stage will be a debate
] ] about alternatives, leading (I hope) to a consensus among
] ] practicing cryptographers about what the substitute will
] ] be.
]
] Answer, not a 5 alarm fire, but if you write or maintain
] cryptography code you can still expect some work coming up.

Hal Finney has posted a nice writeup of Joux's SHA-0 result to the cryptography list. The implications are pretty significant for CHF design...

"Nevertheless, Joux's results cast doubt on the very strategy of building hashes out of iterating compression functions. It appears that there is no hope of creating hashes in this way which approximate the theoretical model of a random function, which is the usual design goal for hash functions. This will probably further motivate researchers to explore new directions in hash function design."

http://www.mail-archive.com/cryptography%40metzdowd.com/msg02611.html

RE: Followup on SHA-1 break

There is a redundant post from Rattle not displayed in this view.