[18720] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: Smooth prime MD5 collisions

daemon@ATHENA.MIT.EDU (Ben Laurie)
Fri Oct 21 15:23:46 2005

X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Fri, 21 Oct 2005 18:42:14 +0100
From: Ben Laurie <ben@algroup.co.uk>
To: "Weger, B.M.M. de" <b.m.m.d.weger@TUE.nl>
Cc: Cryptography <cryptography@metzdowd.com>
In-Reply-To: <9F38CF35D80CAE409B979F3EB5242B4A036ED2DF@winex2.campus.tue.nl>

Weger, B.M.M. de wrote:
> Hi Ben,
> 
> Looks like this is essentially the same as, or at least very similar to,
> 
> what Arjen Lenstra and I did in Section 4 of the full version of our
> paper
> "On the possibility of constructing meaningful hash collisions for
> public keys",
> see http://www.win.tue.nl/~bdeweger/CollidingCertificates/ddl-full.pdf.

:-)

I think I actually did something rather simpler, but I might be missing
something. Let me know when I write it up.

Cheers,

Ben.

-- 
http://www.apache-ssl.org/ben.html       http://www.thebunker.net/

"There is no limit to what a man can do or how far he can go if he
doesn't mind who gets the credit." - Robert Woodruff

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com

home help back first fref pref prev next nref lref last post