1998-12-04 - Streams, Voice, and Sensitive Dependence

Header Data

From: “Lee Davis”<lee.davis@thomasmore.edu>
To: <cypherpunks@Algebra.COM>
Message Hash: 66d3815b58e648f10e6fa5e17ec6d272b1c02f6c042922dc3eb984d370295171
Message ID: <9812049127.AA912797826@smtplink.thomasmore.edu>
Reply To: N/A
UTC Datetime: 1998-12-04 19:32:35 UTC
Raw Date: Sat, 5 Dec 1998 03:32:35 +0800

Raw message

From: "Lee Davis"<lee.davis@thomasmore.edu>
Date: Sat, 5 Dec 1998 03:32:35 +0800
To: <cypherpunks@Algebra.COM>
Subject: Streams, Voice, and Sensitive Dependence
Message-ID: <9812049127.AA912797826@smtplink.thomasmore.edu>
MIME-Version: 1.0
Content-Type: text/plain



It is my understanding that the PGP algorithm is primarily intended as a block
cypher.  Therefore, wouldn't an Outer Block stream cypher be more effective for
phone conversations?  Both solutions require hardware for a practical (tolerably
noiseless) implementation, so there's nothing to be gained by streaming data
into a block format.

In any case, there has been a lot of recent work in dynamic systems (Chaos),
especially in the fast computations of Julia Sets.  Has anyone seen a paper on
exploiting the sensitive dependance in these systems for pseudorandom number
generation?





Thread