bugtraq - RE: SHA-1 broken

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite for Android: free password hash cracker in your pocket

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Date: Sun, 20 Feb 2005 11:46:23 -0600
From: Frank Knobbe <frank@...bbe.us>
To: "Scovetta, Michael V" <Michael.Scovetta@...com>
Cc: Kent Borg <kentborg@...g.org>, Gadi Evron <gadi@...ila.gov.il>,
	bugtraq@...urityfocus.com
Subject: RE: SHA-1 broken

On Thu, 2005-02-17 at 16:34 -0500, Scovetta, Michael V wrote:
> [...] And due to recent discoveries, we can
> push those down to 2**50 and 2**55 respectively. Breaking a composition
> would still take on the order of 2**55 (the harder of the two)

If the two algorithms are different, finding a collision in one of them
does not deliver a working collision in the other, no? Don't you have to
find a "common" collision between the two? Wouldn't that require an
effort of 2**(50+55)?

Regards,
Frank


Download attachment "signature.asc" of type "application/pgp-signature" (188 bytes)