arXiv · 1702.02489
Hash functions using chaotic iterations
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.
Explore related subjects
Keep this discovery
Jacques M. Bahi, Christophe Guyeux. 2017-02-08. Hash functions using chaotic iterations. https://arxiv.org/abs/1702.02489
Cite the original work for its findings. Save a collection to share your selection of sources.