Re: Question about hashing algorithms
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: Question about hashing algorithms

From: Peter Pearson <ppearson@nowhere.invalid>
Date: Sat Aug 27 2005 - 19:54:16 CEST

bigzaphod@gmail.com wrote:

> I was just pondering a distributed file transfer system (like
> bittorrent) which breaks down the file into many small chunks. Each
> chunk is verified with a hash so that you can get the chunk from any
> number of possible sources (and prove it is correct).

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?

-- 
Peter Pearson
To get my email address, substitute:
nowhere -> spamcop, invalid -> net
Received on Thu Sep 29 21:51:08 2005