1996-09-18 - Re: Uses of Computational Chaos

Header Data

From: Adamsc@io-online.com (Adamsc)
To: “EALLENSMITH@ocelot.Rutgers.EDU>
Message Hash: c3535347e372adf8c2895d2f5b09c3f60a71f55d1900fe353bab195eeb5f2fba
Message ID: <19960917191720703.AAA221@IO-ONLINE.COM>
Reply To: N/A
UTC Datetime: 1996-09-18 00:58:45 UTC
Raw Date: Wed, 18 Sep 1996 08:58:45 +0800

Raw message

From: Adamsc@io-online.com (Adamsc)
Date: Wed, 18 Sep 1996 08:58:45 +0800
To: "EALLENSMITH@ocelot.Rutgers.EDU>
Subject: Re: Uses of Computational Chaos
Message-ID: <19960917191720703.AAA221@IO-ONLINE.COM>
MIME-Version: 1.0
Content-Type: text/plain


On Sat, 14 Sep 1996 23:37 EDT, E. Allen Smith wrote:

>	It is reasonably obvious that using _computational_ (as opposed to
>physical) chaos won't increase entropy. But how about using it to make an
>attacker work harder to use any flaws in your method of generating random
>bits? As a simplistic example, say that the scribble window you're using tends
>to result in a 1 for each 3rd bit. Nice and simple for an attacker to exploit.

Supposing, too, that you know these weaknesses, would using separate algorithms
for different portions of the number work well?

# Chris Adams <adamsc@io-online.com> | http://www.io-online.com/adamsc/adamsc.htp
# cadams@acucobol.com | V.M. (619)515-4894
"I have never been able to figure out why anyone would want to play games on
a computer in any case when the whole system is a game.  Word processing,
spreadsheets, telecoms -- it's all a game.  And they pay you to play it."
	-- Duncan Frissell







Thread