[11192] in cryptography@c2.net mail archive
Re: building a true RNG (was: Quantum Computing ...)
daemon@ATHENA.MIT.EDU (Eugen Leitl)
Tue Jul 23 14:04:26 2002
Date: Tue, 23 Jul 2002 08:39:24 +0200 (CEST)
From: Eugen Leitl <eugen@leitl.org>
To: David Honig <dahonig@cox.net>
Cc: "John S. Denker" <jsd@monmouth.com>, <amir@herzberg.name>,
"'Hannes R. Boehm'" <hannes@boehm.org>,
"'Ian Hill'" <Ian@Protonic.com>, <cryptography@wasabisystems.com>
In-Reply-To: <3.0.6.32.20020722153930.007dd3c0@pop.west.cox.net>
On Mon, 22 Jul 2002, David Honig wrote:
> Yes, it is a joke. However, it is also a viable if low-bandwidth
> entropy source. I disagree that you need to be able to model
I've got a framegrabber with a 640x480 24 bit/pixel camera. It doesn't
compress, is rather noisy, and since self-adjusting I get the maximum
entropy at maximum darkness.
Is there any point in compressing the video before running it through a
cryptohash? How does e.g. SHA-1 fare with very sparse bitvectors?
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
