SHAH: Hash Function based on Irregularly Decimated Chaotic Map
Preprint
Abstract
In this paper, we propose a novel hash function based on irregularly decimated chaotic map. The hash function called SHAH is based on two Tinkerbell maps filtered with irregular decimation rule. Exact study has been provided on the novel scheme using distribution analysis, sensitivity analysis, static analysis of diffusion and confusion, and collision analysis. The experimental data show that SHAH satisfied admirable level of security.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Pseudo-random number generator based on discrete-space chaotic mapNonlinear Dynamics, 2017
- A Simple Secure Hash Function Scheme Using Multiple Chaotic Maps3D Research, 2017
- A structure-based chaotic hashing schemeNonlinear Dynamics, 2015
- Using circle map in pseudorandom bit generationAIP Conference Proceedings, 2014
- Pseudo-random bit generator based on Chebyshev mapAIP Conference Proceedings, 2013
- A fast and efficient chaos-based keyed hash functionCommunications in Nonlinear Science and Numerical Simulation, 2013
- Chaotic cryptographic scheme and its randomness evaluationAIP Conference Proceedings, 2012
- A novel method for one-way hash function construction based on spatiotemporal chaosChaos, Solitons & Fractals, 2009
- IEEE Standard for Floating-Point Arithmetic2008
- Chaos: An Introduction to Dynamical SystemsPhysics Today, 1997