Hash functions using chaotic iterations
This work addresses the need for robust cryptographic hash functions in security applications, presenting a novel theoretical approach with potential practical implications.
The authors tackled the problem of generating secure hash functions by mathematically proving that discrete chaotic iterations exhibit chaotic behavior under certain conditions, enabling the proposal of new hash functions with an illustrative example for practical application.
In this paper, a novel formulation of discrete chaotic iterations in the field of dynamical systems is given. Their topological properties are studied: it is mathematically proved that, under some conditions, these iterations have a chaotic behavior in the meaning of Devaney. This chaotic behavior allows us to propose a way to generate new hash functions. An illustration example is detailed in order to show how to use our theoretical study in practice.