On a proposed symbolic dynamics for the Hénon map
Loading...
Authors
Fontana, Antonio Pietro
Subjects
Symbolic Dynamics
Chaos
Pseudorandom number generator
Chaos
Pseudorandom number generator
Advisors
Leader, Jeffery J.
Date of Issue
1993-06
Date
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
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
Type
Thesis
Description
Series/Report No
Department
Applied Mathematics
Organization
Naval Postgraduate School
Identifiers
NPS Report Number
Sponsors
Funding
Format
162 p.
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
