On Tue, 27 Nov 2001, Giles Lean wrote:
> Theoretical at this point, unless you know of a data set where you can
> get 16 byte MD4 checksums to collide for different inputs?

How can it be theoretical? There are 2^128 possible 16-byte checksums,
and 2^8192 possible 1Kbyte files (for example). There _have_ to be
collisions. Now, with MD4, I can't give you an example of two files that
have the same hash, without checking via brute force, but the
possibility of a collision is there.
-- 
Name: Dave Huang         |  Mammal, mammal / their names are called /
INet: khym@azeotrope.org |  they raise a paw / the bat, the cat /
FurryMUCK: Dahan         |  dolphin and dog / koala bear and hog -- TMBG
Dahan: Hani G Y+C 26 Y++ L+++ W- C++ T++ A+ E+ S++ V++ F- Q+++ P+ B+ PA+ PL++