Hash functions using chaotic iterations
From MaRDI portal
Publication:3589424
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.
Recommendations
Cited in
(16)- Efficient chaotic encryption scheme with OFB mode
- Neural networks and chaos: construction, evaluation of chaotic networks, and prediction of chaos with multilayer feedforward networks
- scientific article; zbMATH DE number 1857513 (Why is no real title available?)
- On the link between strongly connected iteration graphs and chaotic Boolean discrete-time dynamical systems
- Constructing chaos-based hash function via parallel impulse perturbation
- Cryptographic hashing using chaotic hydrodynamics
- Secure data aggregation in wireless sensor networks: homomorphism versus watermarking approach
- A topological study of chaotic iterations application to hash functions
- Keyed hash function based on a chaotic map
- Constructing a nondegenerate 2D integer-domain hyperchaotic map over \(\mathrm{GF}(2^n)\) with application in parallel hashing
- Chaos Based Hash Function
- A chaos-based hash function with both modification detection and localization capabilities
- Chaotic keyed hash function based on feedforward-feedback nonlinear digital filter
- Proving chaotic behavior of CBC mode of operation
- Chaos in DNA evolution
- The Grindahl Hash Functions
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)