[148392] in cryptography@c2.net mail archive
Re: [Cryptography] Fun with hardware RNGS: the Infinite Noise
daemon@ATHENA.MIT.EDU (James A. Donald)
Sun Dec 8 20:05:21 2013
X-Original-To: cryptography@metzdowd.com
Date: Sun, 08 Dec 2013 18:15:22 +1000
From: "James A. Donald" <jamesd@echeque.com>
To: cryptography@metzdowd.com
In-Reply-To: <20131208064321.GO761@mournblade.imrryr.org>
Reply-To: jamesd@echeque.com
Errors-To: cryptography-bounces+crypto.discuss=bloom-picayune.mit.edu@metzdowd.com
On Sun, Dec 08, 2013 at 02:14:33PM +1000, James A. Donald wrote:
>> Looks to me that if you perturb this circuit, you will get a
>> different, but equally random set of bits, for, no matter what the
>> perturbation, any noise in the system gets amplified to infinity,
>> even if the enemy is injecting a signal that is cleverly designed to
>> mess with it.
On 2013-12-08 16:43, Viktor Dukhovni wrote:
> That would be true of the mathematically ideal circuit. Yes, the
> baker's transformation is ergodic. However, the physical circuit
> has finite sensitivity.
No, a physical circuit does not have a finite sensitivity. It has a
finite noise floor.
_______________________________________________
The cryptography mailing list
cryptography@metzdowd.com
http://www.metzdowd.com/mailman/listinfo/cryptography
