Introducing the truly chaotic finite state machines and their applications in security field

2017/06/25 by Christophe Guyeux, Qianxue Wang, Guyeux, Christophe +4
Computer Science · Mathematics · #Cellular Automata and Applications #Chaos-based Image/Signal Encryption #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Mathematical Dynamics and Fractals

paper · pdf · doi:10.48550/arxiv.1708.04963

openalex publication_date 2017/06/25 · openalex created_date 2017/08/31 · openalex updated_date 2026/07/28

Abstract

The truly chaotic finite machines introduced by authors in previous research papers are presented here. A state of the art in this discipline, encompassing all previous mathematical investigations, is provided, explaining how finite state machines can behave chaotically regarding the slight alteration of their inputs. This behavior is explained using Turing machines and formalized thanks to a special family of discrete dynamical systems called chaotic iterations. An illustrative example is finally given in the field of hash functions.

Citations

• Performance Analysis of a Keyed Hash Function based on Discrete and\n Chaotic Proven Iterations
• Communication Theory of Secrecy Systems*
• On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems

Related

• Randomness and disorder of chaotic iterations. Applications in information security field
• Chaotic iterations and topological chaos
• The topology of chaotic iterations
• Design and evaluation of chaotic iterations based keyed hash function
• Hash functions using chaotic iterations