[5888] in cryptography@c2.net mail archive
Re: "unbreakable code?" with cash prizes
daemon@ATHENA.MIT.EDU (Eugene Leitl)
Wed Oct 13 00:10:55 1999
From: Eugene Leitl <eugene.leitl@lrz.uni-muenchen.de>
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Message-ID: <14339.58962.970845.90606@lrz.uni-muenchen.de>
Date: Tue, 12 Oct 1999 18:54:26 -0700 (PDT)
To: David Honig <honig@sprynet.com>
Cc: staym@accessdata.com, John Gilmore <gnu@toad.com>, cryptography@c2.net
In-Reply-To: <3.0.5.32.19991012151750.00821220@pop.sprynet.com>
David Honig writes:
> you can think about using the bits. You should hash them before use, to be
> safer.
Of course this assumes that the cryptohash doesn't introduce
exploitable hidden order. There should be a way to distill a physical
entropy source into an equal-probability sea of ones and zeroes
without using the algorithmic bottleneck.
