Hash functions using chaotic iterations
Cryptography and Security
2017-02-09 v1
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.
Keywords
Cite
@article{arxiv.1702.02489,
title = {Hash functions using chaotic iterations},
author = {Jacques M. Bahi and Christophe Guyeux},
journal= {arXiv preprint arXiv:1702.02489},
year = {2017}
}
Comments
Published in Journal of Algorithms and Computational Technology. arXiv admin note: substantial text overlap with arXiv:1511.00117, arXiv:0810.4711, arXiv:1608.05920, arXiv:0810.4702, arXiv:0810.3154