Re: Question about hashing algorithms
From: Peter Pearson (ppearson_at_nowhere.invalid)
Date: 08/27/05
- Next message: Joe Peschel: "Re: My my, how time flies ...... it's been about "1 hour" -- anyone cracked CryptoSMS yet?"
- Previous message: Johnny Bravo: "Re: My my, how time flies ...... it's been about "1 hour" -- anyone cracked CryptoSMS yet?"
- In reply to: bigzaphod_at_gmail.com: "Re: Question about hashing algorithms"
- Next in thread: bigzaphod_at_gmail.com: "Re: Question about hashing algorithms"
- Reply: bigzaphod_at_gmail.com: "Re: Question about hashing algorithms"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sat, 27 Aug 2005 10:54:16 -0700
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
- Next message: Joe Peschel: "Re: My my, how time flies ...... it's been about "1 hour" -- anyone cracked CryptoSMS yet?"
- Previous message: Johnny Bravo: "Re: My my, how time flies ...... it's been about "1 hour" -- anyone cracked CryptoSMS yet?"
- In reply to: bigzaphod_at_gmail.com: "Re: Question about hashing algorithms"
- Next in thread: bigzaphod_at_gmail.com: "Re: Question about hashing algorithms"
- Reply: bigzaphod_at_gmail.com: "Re: Question about hashing algorithms"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|