compressing randomly-generated numbers

[Alexander Klimov]

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 at metzdowd.com