29 citations · 139 across the 31 of their papers we have counts for
5 papers · 1 filter
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…
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…
Performance Analysis of a Keyed Hash Function based on Discrete and Chaotic Proven Iterations
Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux
Security of information transmitted through the Internet is an international concern. This security is guaranteed by tools like hash functions. However, as security flaws have been…
Steganography: a class of secure and robust algorithms
Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux
This research work presents a new class of non-blind information hiding algorithms that are stego-secure and robust. They are based on some finite domains iterations having the Dev…
Class of Trustworthy Pseudo-Random Number Generators
Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux +1
With the widespread use of communication technologies, cryptosystems are therefore critical to guarantee security over open networks as the Internet. Pseudo-random number generator…