8 Jul
2003
8 Jul
'03
11:29 a.m.
hi, --- Mike Rosing <eresrch@eskimo.com> 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.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 collision.How do we make such a compression function? I am not hashing more than 2^160 to get the collisions as you had suggested. Regards Sarath. __________________________________ Do you Yahoo!? SBC Yahoo! DSL - Now only $29.95 per month! http://sbc.yahoo.com