1996-01-06 - Re: More Noise Sphere Noise (simple source code)

Header Data

From: wlkngowl@unix.asb.com (Mutatis Mutantdis)
To: <cypherpunks@toad.com>
Message Hash: a20f31e868322c1c4d8de1310d371a2e38670e7d5a6ed18b194baea3154a355e
Message ID: <199601051644.LAA01347@UNiX.asb.com>
Reply To: N/A
UTC Datetime: 1996-01-06 00:32:18 UTC
Raw Date: Sat, 6 Jan 1996 08:32:18 +0800

Raw message

From: wlkngowl@unix.asb.com (Mutatis Mutantdis)
Date: Sat, 6 Jan 1996 08:32:18 +0800
To: <cypherpunks@toad.com>
Subject: Re: More Noise Sphere Noise (simple source code)
Message-ID: <199601051644.LAA01347@UNiX.asb.com>
MIME-Version: 1.0
Content-Type: text/plain


On Fri, 05 Jan 96 07:24:03, I wrote:

>Ok, no language holy wars.  This was quickie to test out
>the Noise Sphere plotting.  It's in Pascal, but it's
>understandable.

>{ Simple demo of a Noise Sphere in Turbo Pascal         }
>{ (If only I had a really awful RNG to test it with...) }

Odd... That came through on the mail/news gateway but the preceeding
article that explains what that was about didn't.... did anyone
receive it?

In case no, it's based on Clifford A. Pickover's paper "Random Number
Generators: Pretty Good Ones are Easy to Find" which doesn't deal with
useful RNGs for crypto sense, but the paper does explain ways to
visually represent RNGs so that seemingly good RNGs show their awful
correlations, etc.

My previous post that should have showed up mentioned that these
methods might be useful for checking out crypto functions (hashes,
pRNGs, ciphers).

The full reference is The Visual Computer (1995) 11:369-377, Springer
Verlag, 1995.








Thread