[16016] in cryptography@c2.net mail archive
Re: How thorough are the hash breaks, anyway?
daemon@ATHENA.MIT.EDU (Ian Grigg)
Thu Aug 26 20:17:02 2004
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Fri, 27 Aug 2004 00:22:26 +0100
From: Ian Grigg <iang@systemics.com>
To: Daniel Carosone <dan@geek.com.au>
Cc: "Trei, Peter" <ptrei@rsasecurity.com>, cryptography@metzdowd.com
In-Reply-To: <20040826214023.GF1049@bcd.geek.com.au>
Daniel Carosone wrote:
> There is one application of hashes, however, that fits these
> limitations very closely and has me particularly worried:
> 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?
iang
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
