From: “Perry E. Metzger” <pmetzger@lehman.com>
To: cypherpunks@toad.com
Message Hash: 90547e5fcce4e26730f10d16eface17d161dc6460f263080a15966534eda65bf
Message ID: <199401242038.PAA00920@snark>
Reply To: <199401241857.KAA06412@mail.netcom.com>
UTC Datetime: 1994-01-24 20:49:38 UTC
Raw Date: Mon, 24 Jan 94 12:49:38 PST
From: "Perry E. Metzger" <pmetzger@lehman.com>
Date: Mon, 24 Jan 94 12:49:38 PST
To: cypherpunks@toad.com
Subject: Re: Randomness of a bit string
In-Reply-To: <199401241857.KAA06412@mail.netcom.com>
Message-ID: <199401242038.PAA00920@snark>
MIME-Version: 1.0
Content-Type: text/plain
Timothy C. May says:
> Here's a short article I wrote for sci.crypt aboout "randomness" of a
> bit string and the Kolmogorov-Chaitin definition that a string is
> random if and only if it has no shorter description than itself.
With respect, Tim, this definition is insufficient. For cryptographic
purposes, a string must not merely be incompressible but also unknown.
One can imagine things that are uncontrollable and incompressable but
well known -- such as, say the least signifcant bits in the payoffs on
winning horses at some race track.
Perry
Return to January 1994
Return to “tcmay@netcom.com (Timothy C. May)”