# Hash functions using chaotic iterations

## TL;DR

This paper introduces a new class of hash functions based on discrete chaotic iterations, demonstrating their chaotic properties and practical application in cryptography.

## Contribution

It provides a novel formulation of chaotic iterations, proves their chaotic behavior, and applies this to develop new hash functions with demonstrated practical use.

## Key findings

- Chaotic iterations exhibit Devaney chaos under certain conditions.
- The proposed hash functions leverage chaotic properties for cryptographic security.
- An example implementation illustrates the practical application of the theoretical framework.

## Abstract

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.