Re: more about HMAC-SHA-1 security question
- From: Kristian Gjøsteen <kristiag+news@xxxxxxxxxxxx>
- Date: Fri, 28 Mar 2008 08:35:55 +0000 (UTC)
<osmo.sis@xxxxxxxxx> wrote:
Ideas?
The current thinking is that HMAC-SHA-1 is a good PRF, which means that
for a sufficiently large and randomly chosen k, it should be really,
really hard to distinguish HMAC-SHA-1(k,.) from a random function, even
when you're allowed to see function values at any (say) 10^20 points
you care about and think about it for (say) 10^30 seconds.
--
Kristian Gjøsteen
.
- Follow-Ups:
- Re: more about HMAC-SHA-1 security question
- From: osmo . sis
- Re: more about HMAC-SHA-1 security question
- References:
- HMAC-SHA-1 security question
- From: osmo . sis
- Re: HMAC-SHA-1 security question
- From: Joseph Ashwood
- more about HMAC-SHA-1 security question
- From: osmo . sis
- HMAC-SHA-1 security question
- Prev by Date: Blood eating is banned in islam
- Next by Date: Re: Question about license management / software activation
- Previous by thread: more about HMAC-SHA-1 security question
- Next by thread: Re: more about HMAC-SHA-1 security question
- Index(es):