Re: strength of multiple hash functions
- From: Kristian Gjøsteen <kristiag+news@xxxxxxxxxxxx>
- Date: Thu, 25 Jan 2007 08:44:23 +0000 (UTC)
Amit <amitabh123@xxxxxxxxx> wrote:
It is easy to prove (in the random oracle model) that the security
offered by H(.) is the same as that provided by SHA1.
In my opinion, a ROM proof offers no interesting insights in this case.
--
Kristian Gjøsteen
.
- Follow-Ups:
- Re: strength of multiple hash functions
- From: Joseph Ashwood
- Re: strength of multiple hash functions
- From: Amit
- Re: strength of multiple hash functions
- References:
- Re: strength of multiple hash functions
- From: Amit
- Re: strength of multiple hash functions
- Prev by Date: Re: strength of multiple hash functions
- Next by Date: Re: strength of multiple hash functions
- Previous by thread: Re: strength of multiple hash functions
- Next by thread: Re: strength of multiple hash functions
- Index(es):
Relevant Pages
|
|