From: Kent Crispin <kent@songbird.com>
Date: Wed, 10 Sep 1997 05:39:30 +0800
To: cypherpunks@toad.com
Subject: Re: Gao's Chaos Cryptosystem Algorithm
In-Reply-To: <19970909061833.14066.qmail@hotmail.com>
Message-ID: <19970909141358.22785@bywater.songbird.com>
MIME-Version: 1.0
Content-Type: text/plain



On Tue, Sep 09, 1997 at 08:26:25AM -0500, Igor Chudov @ home wrote:
> Nobuki Nakatuji wrote:
> > >Nobuki Nakatuji wrote:
> > >> >I will just repeat Prof. Choate's question, how do you generate Ch.
> > >> Ch generate 
> > >> 
> > >> begin
> > >> Xn+1=aXn(1.0-Xn)
> > >> return Xn+1
> > >> end
> > >
> > >What does aXn(1.0-Xn) mean? That's what I do not understand.
> > >
> > It mean Chaos function.
> 
> How do you calculate this function?
> 
> Thank you.
> 
> 	- Igor.

Forgive me, but isn't this just the standard technique for calculating
these things? Recall the algorithm for calculating points in the
mandelbrot set -- a point X0 is in the set if the infinite series
described above converges to a value within certain bounds? 
[The infinite series defined by 

	X0 = something
	Xn+1 = a * (Xn) * ( 1.0 - (Xn) )
]

This iterative technique is the fundamental idea behind the creation 
of the mandelbrot set and Julia sets, as I recall.

I don't know anything at all about the "Chaos Cryptosystem Algorithm",
but there might actually be more to it than just another onetime pad.

-- 
Kent Crispin				"No reason to get excited",
kent@songbird.com			the thief he kindly spoke...
PGP fingerprint:   B1 8B 72 ED 55 21 5E 44  61 F4 58 0F 72 10 65 55
http://songbird.com/kent/pgp_key.html