[16081] in cryptography@c2.net mail archive
RE: "Approximate" hashes
daemon@ATHENA.MIT.EDU (Jerrold Leichter)
Wed Sep 1 18:27:07 2004
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Wed, 1 Sep 2004 18:05:24 -0400 (EDT)
From: Jerrold Leichter <jerrold.leichter@smarts.com>
To: Keith Ray <keith@nullify.org>
Cc: cryptography@metzdowd.com,
"'Marcel Popescu'" <Marcel_Popescu@microbilt.com>
In-Reply-To: <200409011927.i81JRhFN020024@nullify.org>
| nilsimsa
| Computes nilsimsa codes of messages and compares the codes and finds
| clusters of similar messages so as to trash spam.
|
| What's a nilsimsa code?
|
| A nilsimsa code is something like a hash, but unlike hashes, a small change
| in the message results in a small change in the nilsimsa code.
|
| http://lexx.shinn.net/cmeclax/nilsimsa.html
I had a look at the code (which isn't easy to follow). This appears to be a
new application of Bloom filters.
-- Jerry
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
