[147142] in cryptography@c2.net mail archive
Re: [Cryptography] real random numbers
daemon@ATHENA.MIT.EDU (Kent Borg)
Sun Sep 15 17:47:58 2013
X-Original-To: cryptography@metzdowd.com
Date: Sun, 15 Sep 2013 06:49:25 -0400
From: Kent Borg <kentborg@borg.org>
To: John Kelsey <crypto.jmk@gmail.com>
Cc: "David I. Emery" <die@dieconsulting.com>,
Cryptography List <cryptography@metzdowd.com>, John Denker <jsd@av8n.com>
Errors-To: cryptography-bounces+crypto.discuss=bloom-picayune.mit.edu@metzdowd.com
John Kelsey wrote:
> I think the big problem with (b) is in quantifying the entropy you get.
Maybe don't.
When Bruce Schneier last put his hand to designing an RNG he concluded that estimating entropy is doomed. I don't think he would object to some coarse order-of-magnitude confirmation that there is entropy coming in, but I think trying to meter entropy-in against entropy-out will either leave you starved or fooled.
-kb
_______________________________________________
The cryptography mailing list
cryptography@metzdowd.com
http://www.metzdowd.com/mailman/listinfo/cryptography
