For computer scientists, especially those in the security field, the use of chaos has been limited to the computation of a small collection of famous but unsuitable maps that offer no explanation of why chaos is relevant in the considered contexts. Discrete Dynamical Systems and Chaotic Machines: Theory and Applications shows how to make finite machines, such as computers, neural networks, and wireless sensor networks, work chaotically as defined in a rigorous mathematical framework. Taking into account that these machines must interact in the real world, the authors share their research results on the behaviors of discrete dynamical systems and their use in computer science.
Covering both theoretical and practical aspects, the book presents:
Until the authors’ recent research, the practical implementation of the mathematical theory of chaos on finite machines raised several issues. This self-contained book illustrates how chaos theory enables the study of computer security problems, such as steganalysis, that otherwise could not be tackled. It also explains how the theory reinforces existing cryptographically secure tools and schemes.
An Introduction to Chaos: Classical Examples by Way of Introduction. The Mathematical Theory of Chaos: Definitions and Notations. Devaney’s Formulation of Chaos. Other Formulations of Chaos. From Theory to Practice: A Fundamental Tool: the Chaotic Iterations. Theoretical Proofs of Chaotic Machines. Applications of Chaos in the Computer Science Field: Information Security. Wireless Sensor Networks. Conclusion: Conclusion. Bibliography. Index.