On the link between strongly connected iteration graphs and chaotic Boolean discrete-time dynamical systems

DOI10.1007/978-3-642-22953-4_11MaRDI QIDQ3088276zbMATH OpenOpenAlexFDO

Authors Jean-François Couchot, Christophe Guyeux, Adrien Richard, Jacques M. Bahi

Publication date 19 August 2011

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1112.1684

zbMATH Keywords

Boolean networkdiscrete-time dynamical systemtopological chaos

Mathematics Subject Classification ID

Connectivity (05C40) Applications of graph theory (05C90) Dynamical systems involving maps of trees and graphs (37E25)

Abstract: 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.

Recommendations

• Hash functions using chaotic iterations
• A topological study of chaotic iterations application to hash functions
• Equivalence relations on finite dynamical systems
• On the origin of chaos in autonomous Boolean networks
• On chaotic set-valued discrete dynamical systems

Cites work

• A chaos-based robust wavelet-domain watermarking algorithm
• Chaos-based random number generators-part I: analysis [cryptography]
• Depth-First Search and Linear Graph Algorithms
• Hash functions using chaotic iterations
• scientific article; zbMATH DE number 44378 (Why is no real title available?)
• On Devaney's Definition of Chaos

Cited in

(6)

• Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes
• Discrete dynamical systems on graphs and Boolean functions
• Dynamics on binary relations over topological spaces
• Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations
• A topological study of chaotic iterations application to hash functions
• Constructing chaotic transformations with closed functional forms

This page was built for publication: On the link between strongly connected iteration graphs and chaotic Boolean discrete-time dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088276)