29 citations · 139 across the 31 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2011★ 6 cited
On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems
J. M. Bahi, J. -F. Couchot, C. Guyeux +1
Chaotic functions are characterized by sensitivity to initial conditions, transitivity, and regularity. Providing new functions with such properties is a real challenge. This work…
cs.DM2011★ 4 cited
Steganography: a Class of Algorithms having Secure Properties
Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux
Chaos-based approaches are frequently proposed in information hiding, but without obvious justification. Indeed, the reason why chaos is useful to tackle with discretion, robustnes…