[11227] in cryptography@c2.net mail archive
Re: building a true RNG
daemon@ATHENA.MIT.EDU (Sampo Syreeni)
Mon Jul 29 10:50:25 2002
Date: Sun, 28 Jul 2002 12:38:38 +0300 (EEST)
From: Sampo Syreeni <decoy@iki.fi>
To: David Wagner <daw@cs.berkeley.edu>
Cc: <cryptography@wasabisystems.com>
In-Reply-To: <Pine.SOL.4.30.0207281150030.4829-100000@kruuna.Helsinki.FI>
On 2002-07-28, Sampo Syreeni uttered to David Wagner:
[Answering to my own mail. Sorry.]
>and discard every 1/(p(x)-1/256)'th sample with value x.
Actually the pedantic solution would be to put an arithmetic
compressor/coder between the input and output, using the best model we've
got. That still leaves model adaptation to be dealt with, but if we
discard a sufficient number of output bits at start (estimable from the
model), we *will* end up with (very nearly) flat statistics on the output.
Asymptotic optimality and all that... (The qualification comes from
limited precision arithmetic.)
--
Sampo Syreeni, aka decoy - mailto:decoy@iki.fi, tel:+358-50-5756111
student/math+cs/helsinki university, http://www.iki.fi/~decoy/front
openpgp: 050985C2/025E D175 ABE5 027C 9494 EEB0 E090 8BA9 0509 85C2
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
