[16092] in cryptography@c2.net mail archive
Re: "Approximate" hashes
daemon@ATHENA.MIT.EDU (Len Sassaman)
Mon Sep 6 16:45:46 2004
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Fri, 3 Sep 2004 06:04:20 -0700 (PDT)
From: Len Sassaman <rabbi@abditum.com>
To: Marcel Popescu <Marcel_Popescu@microbilt.com>
Cc: cryptography@metzdowd.com
In-Reply-To: <0c4601c49033$caecb9a0$726e9cd9@mark>
On Wed, 1 Sep 2004, Marcel Popescu wrote:
> Hence my question: is there some "approximate" hash function (which I could
> use instead of SHA-1) which can verify that a text hashes "very close" to a
> value? So that if I change, say, tabs into spaces, I won't get exactly the
> same value, but I would get a "good enough"?
Hi Marcel,
You may wish to look at Cmeclax's nilsimsa. It has been used to detect
slightly-modified message floods in anonymous remailer systems, and was
also used in Spamassassin at some point.
http://lexx.shinn.net/cmeclax/nilsimsa.html
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
