[193793] in North American Network Operators' Group
Re: SHA1 collisions proven possisble
daemon@ATHENA.MIT.EDU (valdis.kletnieks@vt.edu)
Thu Feb 23 21:22:31 2017
X-Original-To: nanog@nanog.org
From: valdis.kletnieks@vt.edu
X-Google-Original-From: Valdis.Kletnieks@vt.edu
To: "Ricky Beam" <jfbeam@gmail.com>
In-Reply-To: <op.yv46z4xmtfhldh@rbeam.xactional.com>
Date: Thu, 23 Feb 2017 21:22:21 -0500
Cc: "nanog@nanog.org" <nanog@nanog.org>
Errors-To: nanog-bounces@nanog.org
--==_Exmh_1487902941_9506P
Content-Type: text/plain; charset=us-ascii
On Thu, 23 Feb 2017 21:10:42 -0500, "Ricky Beam" said:
> When you can do that in the timespan of weeks or days, get back to me.
> Today, it takes years to calculate a collision, and you have to start with
> a document specifically engineered to be modified. (such documents are
> easily spotted upon inspection: why does this word doc contain two
> documents?)
That question never arises, because this word doc contains only one document.
The *OTHER* word doc also contains only one document.
> You can't take any random document, modify it to say what you
> want, and keep the same hash. People still haven't been able to do that
> with MD5, and that's been "broken" for a long time.
That doesn't change the fact that if I can get you to sign a document I
present to you, I can still have lots of fun at your expense.
--==_Exmh_1487902941_9506P
Content-Type: application/pgp-signature
-----BEGIN PGP SIGNATURE-----
Comment: Exmh version 2.5 07/13/2001
iQEVAwUBWK+Y3Y0DS38y7CIcAQKJugf/ZSuahhE5c2JHh8XEzPyZHBOP5s02xmlU
BJuLNftxXsfP6WGcoRzgXUejH4oDWZm7MW8Rewh0OgH7/04n2tyYnkLbKJyuqFqe
DKp4dDeLSO4Mo+bokQ6ehA3zpKUKUjjao474Mtrop2gquCtNBjYhd7v59hBDXqhB
iOrUk3RXXDNwwqXMsy0Po5+a8ACQ2UFV8DfPhr06pOKy3ImcVho6LhMBrs3P+t8/
YRIcN9aLw12wWxeBRcIQQiODR6F9eDkIshYyYSkNAiTVx1vou0RZF/WC85ErIQKw
kDQOsX8bplvcsFubukZSsiOW11bvUIoIQerf+dPuWCSLq9w8nPD9BA==
=wkUv
-----END PGP SIGNATURE-----
--==_Exmh_1487902941_9506P--
