[38656] in cryptography@c2.net mail archive
RE: compressing randomly-generated numbers
daemon@ATHENA.MIT.EDU (Alexander Klimov)
Sun Aug 27 11:48:08 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Wed, 23 Aug 2006 13:57:22 +0300 (IDT)
From: Alexander Klimov <alserkli@inbox.ru>
To: Cryptography <cryptography@metzdowd.com>
In-Reply-To: <09FBAE64AD0E3347A995FEDCDE36F7A103191092@hermes.rairtech.com>
On Thu, 10 Aug 2006, Jeremy Hansen wrote:
> I see where you're coming from, but take an imperfectly random
> source and apply a deterministic function to it, and if I recall
> correctly, you still have a imperfectly random output. It would be
> better to use something like Von Neumann's unbiasing algorithm (or
> any of the newer improvements) to strip out the non-randomness.
A random bit stream should have two properties: no bias and no
dependency between bits. If one has biased but independent bits he
can use the von Neumann algorithm to remove the bias, but if there is
a dependency no algorithm will be able to `strip' it.
--
Regards,
ASK
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
