[35464] in cryptography@c2.net mail archive
Re: compressing randomly-generated numbers
daemon@ATHENA.MIT.EDU (Damien Miller)
Fri Aug 11 18:16:56 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Fri, 11 Aug 2006 15:43:01 +1000 (EST)
From: Damien Miller <djm@mindrot.org>
To: Cryptography <cryptography@metzdowd.com>
In-Reply-To: <d4f1333a0608092044g3dece4c1g19678fd549d71fc0@mail.gmail.com>
On Wed, 9 Aug 2006, Travis H. wrote:
> Hey,
>
> I was mulling over some old emails about randomly-generated numbers
> and realized that if I had an imperfectly random source (something
> less than 100% unpredictable), that compressing the output would
> compress it to the point where it was nearly so. Would there be any
> reason to choose one algorithm over another for this application?
What are you trying to achieve?
An ARC4 keystream derived from fixed key is 100% predictable and yet
cannot be compressed by anything you would normally call a "compression
algorithm".
-d
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
