[98161] in cryptography@c2.net mail archive
Re: Re: Fwd: Potential SHA 1 Hack Using Distributed Computing -
daemon@ATHENA.MIT.EDU (Christian Rechberger)
Wed Aug 15 10:39:42 2007
Date: Tue, 14 Aug 2007 23:31:33 +0200
From: Christian Rechberger <christian.rechberger@TUGraz.at>
To: Paul Hoffman <paul.hoffman@vpnc.org>
Cc: Cryptography <cryptography@metzdowd.com>
In-Reply-To: <p06240806c2e7b10279f1@[165.227.249.213]>
Quoting Paul Hoffman <paul.hoffman@vpnc.org>:
> At 11:00 PM -0700 8/13/07, Aram Perez wrote:
>> Anyone know more about this?
>
> I have the same question. I could not find any description of *why*
> they think that finding near-misses is going to help the research.
> It's not clear if they are taking their own path, or trying to
> improve Wang's path, or what.
The mentioned article is indeed confusing, the information in there
took apparently several hops.
To address your questions: Indeed, we have our own "path", but more
importantly we developed a new method to speed-up generation and
testing of candidate message pairs and apply it to SHA-1. The
resulting work factor is still quite high, hence we ask for
contributions via the BOINC framework.
More information on cryptanalytic details, type of collision, and
resulting work factor will appear later this year.
-Christian
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
