cryptoanarchy.wiki

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

1998-10-01 - Re: Randomness testing

Header Data

From: Mok-Kong Shen <mok-kong.shen@stud.uni-muenchen.de>
To: Clifford Heath <cjh@osa.com.au>
Message Hash: fb1e9747934586f38ee5f0f048e495c4f0c231d75bbc6ed3a589a6c63e60954b
Message ID: <3614A761.380173E0@stud.uni-muenchen.de>
Reply To: <m0zOxtY-0001eoC@magpie.osa.com.au>
UTC Datetime: 1998-10-01 20:22:07 UTC
Raw Date: Fri, 2 Oct 1998 04:22:07 +0800

Raw message

From: Mok-Kong Shen <mok-kong.shen@stud.uni-muenchen.de>
Date: Fri, 2 Oct 1998 04:22:07 +0800
To: Clifford Heath <cjh@osa.com.au>
Subject: Re: Randomness testing
In-Reply-To: <m0zOxtY-0001eoC@magpie.osa.com.au>
Message-ID: <3614A761.380173E0@stud.uni-muenchen.de>
MIME-Version: 1.0
Content-Type: text/plain



Clifford Heath wrote:
> 
> We have been asked by a customer if we have any tests that demonstrate
> the randomness of the SSLeay random number generator (augmented by some
> sound-card random number seeding that we wrote).
> 
> I'd like to find some standard implementation for testing randomness, but
> Schneier offers no help (other than a reference to Knuth Vol 2), and I
> don't know where else to turn.

I suggest that you do at least Maurer's test which is described
in A. J. Menezes et al. Handbook of Applied Cryptography. The
test is not difficult to code. You could also look at my code in
http://www.stud.uni-muenchen.de/~mok-kong.shen/#paper1 in Fortran.

M. K. Shen

Thread