[16045] in cryptography@c2.net mail archive
Re: How thorough are the hash breaks, anyway?
daemon@ATHENA.MIT.EDU (Matt Crawford)
Tue Aug 31 14:32:31 2004
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Mon, 30 Aug 2004 10:46:50 -0500
From: Matt Crawford <crawdad@fnal.gov>
In-reply-to: <412E70B2.8030603@systemics.com>
To: Ian Grigg <iang@systemics.com>
Cc: Daniel Carosone <dan@geek.com.au>,
crypto <cryptography@metzdowd.com>
>> certificates. The public key data is public, and it's a "random"
>> bitpattern where nobody would ever notice a few different bits.
>> If someone finds a collision for microsoft's windows update cert (or a
>> number of other possibilities), and the fan is well and truly buried
>> in it.
>
> Correct me if I'm wrong ... but once finding
> a hash collision on a public key, you'd also
> need to find a matching private key, right?
But the odds are that you'd get an easy-to-factor modulus. Would the
casual relying party ever notice that? I think not.
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
