[18253] in cryptography@c2.net mail archive
herding attack paper submitted to ePrint archive
daemon@ATHENA.MIT.EDU (John Kelsey)
Mon Aug 22 17:30:19 2005
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Mon, 22 Aug 2005 16:43:29 -0400 (GMT-04:00)
From: John Kelsey <kelsey.j@ix.netcom.com>
Reply-To: John Kelsey <kelsey.j@ix.netcom.com>
To: cryptography@metzdowd.com
Guys,
Yoshi and I have submitted a draft of the Herding Hash Functions
paper up on the IACR ePrint server, and assuming there are
no problems, it should be up reasonably soon. The core of
the result is that when I can find lots of collisions for a
hash function by brute force (or maybe analytically, though
that gets more complicated), I can also break most systems
that use a hash function to prove prior knowledge. I gave a
rump session talk on this a few days ago at Crypto.
--John Kelsey, NIST, August 2005
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
