cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1998-10-22 - Re: PRNGs and testers.

Header Data

From: David Honig <honig@sprynet.com>
To: Mok-Kong Shen <rsriram@krdl.org.sg>
Message Hash: 641b56381b879d0105b1a97de77b1cd877326a4dcba13141be143b94efab4f94
Message ID: <3.0.5.32.19981022150348.0091c990@m7.sprynet.com>
Reply To: <19981021151835.A26267@krdl.org.sg>
UTC Datetime: 1998-10-22 22:42:10 UTC
Raw Date: Fri, 23 Oct 1998 06:42:10 +0800

Raw message

From: David Honig <honig@sprynet.com>
Date: Fri, 23 Oct 1998 06:42:10 +0800
To: Mok-Kong Shen <rsriram@krdl.org.sg>
Subject: Re: PRNGs and testers.
In-Reply-To: <19981021151835.A26267@krdl.org.sg>
Message-ID: <3.0.5.32.19981022150348.0091c990@m7.sprynet.com>
MIME-Version: 1.0
Content-Type: text/plain



At 11:30 AM 10/21/98 +0100, Mok-Kong Shen wrote:
>
>Not answerable.  (Reason: substitute car, HIFI, medical doctor, etc. 
>for 'software PRNG').

Nice metaphors.

>> 2. Are there any software implementations to test the randomness of a
>>    PRNG ? I've looked at Diehard - is there anything else?
>
>There are tests that one can implement with reasonable effort.
>A test relevant in cryptology is Maurer's test.

Recall that Ueli's Universal Statistical Test
is valid only for real sources of entropy.
PRNGs have zero entropy asymptotically ;-)

Thread