Re: Intel announcements at RSA '99

New Message Reply About this list Date view Thread view Subject view Author view

Mike Rosing (eresrch@msn.fullfeed.com)
Fri, 22 Jan 1999 16:22:49 -0600 (CST)


On Fri, 22 Jan 1999, James A. Donald wrote:

> He meant lower bound. A rigged or faulty RNG will have near
> zero entropy.
>

Doh! That's what I get for not finishing that first cup of coffee :-)

> Knowledge of the underlying hardware, knowledge that shows it
> derives its randomness from the fundamental randomness of the
> universe, either thermal entropy, (Johnson noise) or quantum
> indeterminacy (shot noise), knowledge that enables us to
> determine the good functioning of the underlying noise
> amplification circuits from the character of the output.
>
> A good circuit would simply directly amplify the underlying
> noise source, so that the entropy of the output would be
> somewhat less than one entropy bit per signal bit, thus
> ensuring that any malfunction of the underlying circuit would
> be obvious.

Cool, I can easily do all that. I'm still not sure how you convert
a real signal into whatever the definition of "digital entropy" is,
but at least I can pass DIEHARD and Diaphony. It will be interesting to
see how well the P3 does with its RNG.

Patience, persistence, truth,
Dr. mike


New Message Reply About this list Date view Thread view Subject view Author view

 
All trademarks and copyrights are the property of their respective owners.

Other Directory Sites: SeekWonder | Directory Owners Forum

The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:18:04