Re: a new very fast hash algorithm (160 bits), with a technique of "overlapping sums"

From: Scott Contini (contini_at_matmail.com)
Date: 09/24/04


Date: 24 Sep 2004 00:52:40 -0700

The hash function is not secure. Here are two inputs that hash to
all 0's (hexadecimal words).

Input 1:
ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff
ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff
ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff
ffffffff ffffffff ffffffff ffffffff

Input 2:
0 0 0 0 0 ffffdffe ffffdffe ffffdffe ffffdffe ffffdffe ffffffff
ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff
ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff

I can easily construct 2^32 inputs that hash to 0 (or actually, I can
make
more).

Scott