1996-02-20 - Re: True random numbers

Header Data

From: daw@dawn9.CS.Berkeley.EDU (David A Wagner)
To: cypherpunks@toad.com
Message Hash: 8e9d7c08819c284d5bfb5d348518b2b9936c8cb205cc532080d06a97a1746f1d
Message ID: <199602201017.FAA06008@bb.hks.net>
Reply To: N/A
UTC Datetime: 1996-02-20 10:44:22 UTC
Raw Date: Tue, 20 Feb 1996 18:44:22 +0800

Raw message

From: daw@dawn9.CS.Berkeley.EDU (David A Wagner)
Date: Tue, 20 Feb 1996 18:44:22 +0800
To: cypherpunks@toad.com
Subject: Re: True random numbers
Message-ID: <199602201017.FAA06008@bb.hks.net>
MIME-Version: 1.0
Content-Type: text/plain


-----BEGIN PGP SIGNED MESSAGE-----

In article <9602191812.AA07312@toad.com>,  <eli+@GS160.SP.CS.CMU.EDU> wrote:
> Persi Diaconis gave a talk here last week on pseudorandom generation,
> during which he was asked by people didn't use hardware RNGs.  He said
> that he wasn't aware of any that passed the standard battery of
> statistical tests.

Well, he's just being silly then.

Throw the true random numbers into a hash function, and voila! they
pass all the standard battery of tests.

The hard part, IMHO, is figuring out how much true entropy you've got.
(Estimate, but be very conservative!  Mistakes are costly.)
- ---
[This message has been signed by an auto-signing service.  A valid signature
means only that it has been received at the address corresponding to the
signature and forwarded.]

-----BEGIN PGP SIGNATURE-----
Version: 2.6.2
Comment: Gratis auto-signing service

iQBFAwUBMSmfoioZzwIn1bdtAQHn3wF9E/jnTYZAgUM/Xkd9XCn2kfI1kJw6I1j8
PUkrLrMoy8hL5HVLHOxemVgQAyQQqnSD
=OheY
-----END PGP SIGNATURE-----





Thread