Re: Toaster to Generate Random Numbers
From: lurker (na@nospam.org)
Date: 01/18/03
- Next message: David Wagner: "Re: Bijective - an explanation please?"
- Previous message: DSCOTT: "Re: Bijective - an explanation please?"
- In reply to: Nicol So: "Re: Toaster to Generate Random Numbers"
- Next in thread: Paul Crowley: "Re: Toaster to Generate Random Numbers"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
From: na@nospam.org (lurker) Date: Sat, 18 Jan 2003 17:43:01 GMT
On Fri, 17 Jan 2003 22:43:40 -0500, Nicol So <nobody@no.spam.please>
wrote:
>Nicol So wrote:
>>
>> ..., the output of
>> a (suitable) hash function contains most of the entropy in the input.
>> The expected lost of entropy can be estimated analytically, and is
>> small.
>
>Quite obviously, the above comment applies only when the entropy in the
>input is less than the number of bits in the output.
>
>--
>Nicol So
>Disclaimer: Views expressed here are casual comments and should
>not be relied upon as the basis for decisions of consequence.
Calculating this could be a challenge unless you are satisfied with
some round off error :- { )
- Next message: David Wagner: "Re: Bijective - an explanation please?"
- Previous message: DSCOTT: "Re: Bijective - an explanation please?"
- In reply to: Nicol So: "Re: Toaster to Generate Random Numbers"
- Next in thread: Paul Crowley: "Re: Toaster to Generate Random Numbers"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|