On a proposed symbolic dynamics for the Hénon map
By:  Antonio Pietro Fontana
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1993
Place of publication: Monterey, Calif; Springfield,   Va
Language: eng
Number of pages: 162
Description: 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.
Notes: Thesis advisor(s): Jeffery J. Leader ; Ismor Fischer.

"June 1993."

Thesis (M.S. in Applied Mathematics) Naval Postgraduate School, June 1993.

Includes bibliographical references.

Approved for public release; distribution unlimited.

Also available online.

Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.

US Navy (USN) author.