On a Proposed Symbolic Dynamics for the Henon Map
Abstract
The utility of a computationally simple yet cryptologically robust rule for generating pseudorandom bitstreams cannot be overstated. In most applications we strive to detect and avoid chaotic behavior; here we embrace a particular chaotic discrete dynamical system to exploit its use as a driver for a pseudorandom number generator. The map from the Henon attractor to the binary domain (0,1) proposed by Forre/Heyman has been tested cryptologically and statistically with mixed results. In this thesis we mathematically evaluate this symbolic dynamics scheme and investigate more rigorously its utility as a pseudorandom number generator. Specifically, we demonstrate how the property of being one-to-one holds, but that the property of being onto does not.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1993
- Accession Number
- ADA272514
Entities
People
- Antonio P. Fontana
Organizations
- Naval Postgraduate School