Re: Can SHA-1 produce dupe hash values?
From: Alan (a__l__a__n_at_hotmail.com)
Date: 09/30/04
- Next message: Jean-Luc Cooke: "Re: new /dev/random"
- Previous message: Guy Macon: "Re: What is a "perfect secret" ?"
- In reply to: Damian Menscher: "Re: Can SHA-1 produce dupe hash values?"
- Next in thread: Michael Amling: "Re: Can SHA-1 produce dupe hash values?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Thu, 30 Sep 2004 11:16:15 -0400
"Damian Menscher" <menscher+crypt@uiuc.edu> wrote in message
news:cjfdor$gn6$1@news.ks.uiuc.edu...
> car <car_member@newsguy.com> wrote:
> As you say, there can be collisions. However, the chances of seeing
> a random collision (from a so-called "birthday attack" are one in
> 2^80 (80 is half the SHA-1 hash size of 160 bits).
That is generally assumed, but not known to be true. We do not know that
all possible 160-bit permutations are possible outputs of SHA-1. To put it
another way, given the set of all possible 160 bit values as inputs to
SHA-1, it is not known how large the corresponding set of outputs is.
- Next message: Jean-Luc Cooke: "Re: new /dev/random"
- Previous message: Guy Macon: "Re: What is a "perfect secret" ?"
- In reply to: Damian Menscher: "Re: Can SHA-1 produce dupe hash values?"
- Next in thread: Michael Amling: "Re: Can SHA-1 produce dupe hash values?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|
