Hash functions using chaotic iterations

From MaRDI portal
Publication:3589424

DOI10.1260/1748-3018.4.2.167zbMATH Open1264.37002arXiv1702.02489OpenAlexW2124258972MaRDI QIDQ3589424FDOQ3589424


Authors: Christophe Guyeux, Jacques M. Bahi Edit this on Wikidata


Publication date: 20 September 2010

Published in: Journal of Algorithms & Computational Technology (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1702.02489




Recommendations





Cited In (16)





This page was built for publication: Hash functions using chaotic iterations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589424)