A Topological Study of Chaotic Iterations. Application to Hash Functions

Understand

Chaotic iterations, a tool formerly used in distributed computing, has recently revealed various interesting properties of disorder leading to its use in the computer science security field.

• In this paper, a comprehensive study of its topological behavior is proposed.
• It is stated that, in addition to being chaotic as defined in the Devaney's formulation, this tool possesses the property of topological mixing.
• Additionally, its level of sensibility, expansivity, and topological entropy are evaluated.