Diffusion and confusion of chaotic iteration based hash functions
This work addresses the need for more secure hash functions for data integrity in Internet communications, but it appears incremental as it builds on existing chaotic iteration methods without claiming major breakthroughs.
The authors tackled the problem of security flaws in widely used hash functions by proposing new hash functions based on chaotic iterations with Devaney-defined chaotic properties, and they provided diffusion and confusion analyses along with a comparative study to enhance applicability in security contexts.
To guarantee the integrity and security of data transmitted through the Internet, hash functions are fundamental tools. But recent researches have shown that security flaws exist in the most widely used hash functions. So a new way to improve their security performance is urgently demanded. In this article, we propose new hash functions based on chaotic iterations, which have chaotic properties as defined by Devaney. The corresponding diffusion and confusion analyzes are provided and a comparative study between the proposed hash functions is carried out, to make their use more applicable in any security context.