Date: Wed, 26 Jul 2000 00:17:19 -0700 (PDT) From: Kris Kennaway <kris@FreeBSD.org> To: "Jeroen C. van Gelderen" <jeroen@vangelderen.org>, markm@freebsd.org Cc: arch@freebsd.org Subject: Re: Estimating entropy Message-ID: <Pine.BSF.4.21.0007260015040.64909-100000@freefall.freebsd.org> In-Reply-To: <Pine.BSF.4.21.0007252346200.58758-100000@freefall.freebsd.org>
next in thread | previous in thread | raw e-mail | index | archive | help
On Tue, 25 Jul 2000, Kris Kennaway wrote:
> I've been looking for some good entropy estimation algorithms which are
> suitable for running "online", i.e. at runtime to estimate the content of
> a set of samples. I haven't had much success so far - the only two things
> I can think of are to keep a pool of the last n samples from a source, and
> then either:
I should add that these are general-purpose estimators. The previous
/dev/random uses a higher-order timing differential to estimate time-based
measurements, although I don't currently understand the reasoning behind
the algorithm. Does anyone have pointers to the literature about this?
Kris
--
In God we Trust -- all others must submit an X.509 certificate.
-- Charles Forsythe <forsythe@alum.mit.edu>
To Unsubscribe: send mail to majordomo@FreeBSD.org
with "unsubscribe freebsd-arch" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.BSF.4.21.0007260015040.64909-100000>