[18079] in cryptography@c2.net mail archive
Re: Query about hash function capability
daemon@ATHENA.MIT.EDU (Jason Holt)
Fri Aug 5 15:22:18 2005
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Thu, 4 Aug 2005 20:22:54 +0000 (UTC)
From: Jason Holt <jason@lunkwill.org>
To: Arash Partow <arash@partow.net>
Cc: cryptography@metzdowd.com
In-Reply-To: <42F183B7.6090606@partow.net>
On Thu, 4 Aug 2005, Arash Partow wrote:
> ie: input1 : abcdefg -> h(abcdefg) = 123
> input2 : gabcdef -> h(gabcdef) = 123
> input3 : fgabcde -> h(fgabcde) = 123
I don't have a formal reference for you, but this seems intuitively correct to
me: put the strings in a canonical form so that all equivalent strings reduce
to the same string, then hash conventionally. Eg., for rotation, the
canonical form of a string is the rotation which gives the smallest value when
the string is considered a binary number. In other words, alphabetize all the
rotations and then take the first one.
-J
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
