Hash Functions Using Chaotic Iterations

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 proven that, under some conditions, these iterations have a chaotic behavior as defined by Devaney. This chaotic behavior allow...

Full description

Saved in:
Bibliographic Details
Published inJournal of algorithms & computational technology Vol. 4; no. 2; pp. 167 - 181
Main Authors Bahi, Jacques M., Guyeux, Christophe
Format Journal Article
LanguageEnglish
Published London, England SAGE Publications 01.06.2010
SAGE and Multi-science
SAGE Publishing
Subjects
Algorithms
Chaos theory
Computer Science
Cryptography and Security
Distributed, Parallel, and Cluster Computing
Dynamical systems
Hash based algorithms
Iterative methods
Mathematical analysis
Mathematical models
Modeling and Simulation
Topology
Discrete dynamical systems
hash functions
chaotic iterations. Devaney's chaos
Online AccessGet full text

Cover

More Information
Summary: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 proven that, under some conditions, these iterations have a chaotic behavior as defined by Devaney. This chaotic behavior allows us to propose a way to generate new hash functions. An illustrative example is detailed in order to show how to use our theoretical study in practice.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1748-3018
1748-3026
DOI:10.1260/1748-3018.4.2.167