Use of Chaotic Dynamical Systems to Generate Pseudorandom Bitstreams

摘要

There exist a variety of coding applications that require the generation ofpseudorandom bitstreams. Such as sequences must meet the conflicting requirements that they be reliably repeatable as well as unpredictable. That is, neither knowledge of a small-sequence nor an imperfect knowledge of the initial conditions (i.e. the key) will be sufficient to recover the entire sequence. In this thesis we exploit the inherent unpredictability of a chaotic discrete dynamical system. Specifically, we develop a mapping of the Henon horseshoe attractor into the binary domain and demonstrate that the sequences produced meet specified criteria of pseudorandomness.