At 02:59 AM 7/9/03 -0700, Sarad AV wrote:
>hi,
>> MV:
>>There's nothing gained by
>> increasing
>> the input entropy (compressing
>
>I was looking for such a compression function such
>that the chances of collision in the message digest
>obtained by hashing these 2^80 messages is collision
>free or
At 11:18 PM 7/7/03 -0700, Sarad AV wrote:
>Lets say we are using SHA-1 and i hash 2^80
>messages.What I am looking for is a compression
>function such that the chances of collision in the
>message digest obtained by hashing these 2^80 messages
>is collision free or very low probability of
>collisio
hi,
--- Mike Rosing <[EMAIL PROTECTED]> wrote:
>It can't be collision free if the number of input
> bits exceeds the number
> of output bits. Think about it, it should be
> obvious!
Yes,the pigeon hole principle but that was not what i
meant.
Lets say we are using SHA-1 and i hash 2^80
messages
At 02:19 AM 7/7/03 -0700, Sarad AV wrote:
or how are we supposed to
>find collision free hash functions?What exactly is the
>difficulty in finding collision free hash functions?
Because there are no collision *free* hash functions,
there will always be several domain elements that map to the
same
