From: Mok-Kong Shen <mok-kong.shen@stud.uni-muenchen.de>
To: X1 <rsriram@krdl.org.sg>
Message Hash: 871f6c184d7e87253fe5e2f929c2254aa8e4e7643975c216b1e5e53329fee776
Message ID: <362DB7C9.F0DE3296@stud.uni-muenchen.de>
Reply To: <19981021151835.A26267@krdl.org.sg>
UTC Datetime: 1998-10-21 10:01:35 UTC
Raw Date: Wed, 21 Oct 1998 18:01:35 +0800
From: Mok-Kong Shen <mok-kong.shen@stud.uni-muenchen.de>
Date: Wed, 21 Oct 1998 18:01:35 +0800
To: X1 <rsriram@krdl.org.sg>
Subject: Re: PRNGs and testers.
In-Reply-To: <19981021151835.A26267@krdl.org.sg>
Message-ID: <362DB7C9.F0DE3296@stud.uni-muenchen.de>
MIME-Version: 1.0
Content-Type: text/plain
X1 wrote:
>
> Hi,
>
> A few questions on Pseudo Random Number Generators...
>
> 1. Which are the best software PRNG's available today?
Not answerable. (Reason: substitute car, HIFI, medical doctor, etc.
for 'software PRNG').
>
> 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. See Menezes et al.,
Handbook of Applied Cryptography.
M. K. Shen
Return to October 1998
Return to “X1 <rsriram@krdl.org.sg>”