[1954] in cryptography@c2.net mail archive
chaotic vs random functions
daemon@ATHENA.MIT.EDU (Julian Assange)
Fri Dec 12 18:31:00 1997
Date: 12 Dec 1997 05:26:20 -0000
From: Julian Assange <proff@iq.org>
To: coderpunks@toad.com, cryptography@c2.net
I'm looking for a chaotic (seeded) iterative function, that has
the following property:
Presume that the output of our function f is normalised into
the ranges +/- 1. It is not predictable over i iterations
of the function (and i is large, say a few billion) whether
the average of outputs to that point is close to zero. i.e
there is no faster way to determine the average of outputs of
f over period i iterations without conducting all i
iterations. It's reasonable for the average output of f to
"tend to the average" as i grows large, but I'd like
"long periods" of unpredictably non-random behavior.
Cheers,
Julian.
--
Prof. Julian Assange |If you want to build a ship, don't drum up people
|together to collect wood and don't assign them tasks
proff@iq.org |and work, but rather teach them to long for the endless
proff@gnu.ai.mit.edu |immensity of the sea. -- Antoine de Saint Exupery
