Hash Functions Using Chaotic Iterations - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Algorithms and Computational Technology Année : 2010

Hash Functions Using Chaotic Iterations

Résumé

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.
Fichier principal
Vignette du fichier
bg10_ij.pdf (243.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00563113 , version 1 (07-02-2011)

Identifiants

  • HAL Id : hal-00563113 , version 1

Citer

Jacques Bahi, Christophe Guyeux. Hash Functions Using Chaotic Iterations. Journal of Algorithms and Computational Technology, 2010, 4 (2), pp.167-181. ⟨hal-00563113⟩
219 Consultations
299 Téléchargements

Partager

Gmail Facebook X LinkedIn More