Idioma:

Hash Functions Using Chaotic Iterations

Bahi, Jacques M. ; Guyeux, Christophe

Journal of algorithms & computational technology, 2010-06, Vol.4 (2), p.167-181 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Hash Functions Using Chaotic Iterations
Autor: Bahi, Jacques M. ; Guyeux, Christophe
Assuntos: 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
É parte de: Journal of algorithms & computational technology, 2010-06, Vol.4 (2), p.167-181
Notas: ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição: 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.
Editor: London, England: SAGE Publications
Idioma: Inglês;Francês

Links

Voltar para lista de resultados