On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems

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.
Type de document :
Communication dans un congrès
18th International Symposium on Fundamentals of Computation Theory (FCT 2011), Aug 2011, Oslo, Norway. 6914, pp.126-137, 2011, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01298868
Contributeur : Adrien Richard <>
Soumis le : jeudi 7 avril 2016 - 17:48:59
Dernière modification le : vendredi 8 avril 2016 - 01:05:48
Document(s) archivé(s) le : vendredi 8 juillet 2016 - 11:14:16

Fichier

1112.1684v1.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

J. M. Bahi, J. -F. Couchot, C. Guyeux, A. Richard. On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems. 18th International Symposium on Fundamentals of Computation Theory (FCT 2011), Aug 2011, Oslo, Norway. 6914, pp.126-137, 2011, Lecture Notes in Computer Science. <hal-01298868>

Partager

Métriques

Consultations de
la notice

50

Téléchargements du document

18