Re: Question about hashing algorithms

On 2005-08-27 12:54:16 -0500, Peter Pearson <ppearson@nowhere.invalid> said:

> Are you trying to protect against an intelligent adversary, or
> only against the possibility of two chunks accidentally having
> the same hash? If the latter, what is the size of the universe
> of chunks among which hash collisions would cause trouble?

The idea would be to protect against an intelligent adversary from
flooding the network with invalid data blocks. Large data files which
would be made up of many smaller blocks would ideally not be able to be
corrupted by an attacker exploiting some easy flaw in the hashing
algorithm for finding overlapping data.

l8r
Sean
Received on Thu Sep 29 21:51:33 2005