Diffusion and confusion of chaotic iteration based hash functions

TL;DR

This paper introduces new hash functions based on chaotic iterations with properties ensuring data security, providing diffusion and confusion analysis, and comparing their effectiveness for improved Internet data integrity.

Contribution

The paper proposes novel hash functions utilizing chaotic iterations, offering enhanced security features and comprehensive analysis for practical application in data integrity.

Findings

Chaotic iteration-based hash functions exhibit strong diffusion and confusion properties.

Comparative analysis shows improved security performance over traditional hash functions.

The proposed methods are adaptable for various security contexts.

Abstract

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.