[8082] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: Lots of random numbers

daemon@ATHENA.MIT.EDU (Kris Kennaway)
Sat Nov 18 14:36:07 2000

Date: Fri, 17 Nov 2000 17:43:28 -0800
From: Kris Kennaway <kris@FreeBSD.org>
To: David Honig <honig@sprynet.com>
Cc: cryptography@c2.net
Message-ID: <20001117174328.A18556@citusc17.usc.edu>
Mime-Version: 1.0
Content-Type: multipart/signed; micalg=pgp-md5;
	protocol="application/pgp-signature"; boundary="7AUc2qLy4jB3hD7Z"
Content-Disposition: inline
In-Reply-To: <3.0.6.32.20001116183235.007c6680@pop.sprynet.com>; from honig@sprynet.com on Thu, Nov 16, 2000 at 06:32:35PM -0800


--7AUc2qLy4jB3hD7Z
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline

On Thu, Nov 16, 2000 at 06:32:35PM -0800, David Honig wrote:

> And don't forget to measure the entropy of your conditioned
> output.  You must condition, raw measurement isn't good enough.
> Search Shannon or Maurer or "diehard" for more.

I don't understand the use of diehard for cryptographic purposes..it
is very easy to make a low-entropy source which passes the statistical
tests it performs (e.g. output of a stream cipher with a constant
key). diehard seems only useful for testing random number generators
used for statistical or simulation purposes, not cryptographic ones.

Kris

--7AUc2qLy4jB3hD7Z
Content-Type: application/pgp-signature
Content-Disposition: inline

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.4 (FreeBSD)
Comment: For info see http://www.gnupg.org

iEYEARECAAYFAjoV3sAACgkQWry0BWjoQKV9rgCgkK4KXET0Enl5kiUIlUfXIYR1
ZAMAnjbBxCJPm9/tZByxqKRM3uXOvSdZ
=GYZw
-----END PGP SIGNATURE-----

--7AUc2qLy4jB3hD7Z--


home help back first fref pref prev next nref lref last post