Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Thu May 27 1999 - 23:44:21
David Honig (honig@sprynet.com)
Fri, 09 Apr 1999 11:23:54 -0700
At 11:39 AM 4/9/99 -0400, mgraffam@idsi.net wrote:
>On Fri, 9 Apr 1999 steven.soroka@mts.mb.ca wrote:
>
>> > Is there any analysis of /dev/random used by Linux available?
>>
>> I doubt it would pass a statistical test in diehard.. if anyone really
wants to know, msg me
>> and I'll give it a shot and post the results..
>
>I've done it. It passes with flying colors; as has been noted.. anything
>hashed with SHA kicks Diehard's ass.. /dev/zero will too if processed with
>SHA correctly..
True.
You would have to dump the *raw* bits coming in, measure their
entropy[1], and look at how many bits in for each bit out. Then you
would have a measure on physical-entropy-per-output bit.
Measuring the hashed output just tells you that the hashing/chaining is
done correctly.
[1] Here MUST is more appropriate than Diehard.
The following archive was created by hippie-mail 7.98617-22 on Thu May 27 1999 - 23:44:21