2011/12/07 by Jacques M. Bahi, Jean-François Couchot, Bahi, J. M. +5 · 1 citation
Computer Science · Physics and Astronomy · #Cellular Automata and Applications #Chaos control and synchronization #Chaos-based Image/Signal Encryption #Cryptography and Security (cs.CR) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.1112.1684
openalex publication_date 2011/12/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Chaotic functions are characterized by sensitivity to initial conditions, transitivity, and regularity. Providing new functions with such properties is a real challenge. This work shows that one can associate with any Boolean network a continuous function, whose discrete-time iterations are chaotic if and only if the iteration graph of the Boolean network is strongly connected. Then, sufficient conditions for this strong connectivity are expressed on the interaction graph of this network, leading to a constructive method of chaotic function computation. The whole approach is evaluated in the chaos-based pseudo-random number generation context.