SHAH: Hash Function based on Irregularly Decimated Chaotic Map

07/29/2018
by   Mihaela Todorova, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2023

Cryptanalysis of a Cayley Hash Function Based on Affine Maps in one Variable over a Finite Field

Cayley hash functions are cryptographic hashes constructed from Cayley g...
research
08/14/2021

Probability Distributions for Elliptic Curves in the CGL Hash Function

Hash functions map data of arbitrary length to data of predetermined len...
research
08/10/2023

Quantum-inspired Hash Function Based on Parity-dependent Quantum Walks with Memory

In this paper, we develop a generic controlled alternate quantum walk mo...
research
05/04/2023

A Sparse Johnson-Lindenstrauss Transform using Fast Hashing

The Sparse Johnson-Lindenstrauss Transform of Kane and Nelson (SODA 2012...
research
05/30/2019

Proof-of-forgery for hash-based signatures

In the present work, a peculiar property of hash-based signatures allowi...
research
05/28/2023

Image Hash Minimization for Tamper Detection

Tamper detection using image hash is a very common problem of modern day...
research
09/16/2019

RVH: Range-Vector Hash for Fast Online Packet Classification

Packet classification according to multi-field ruleset is a key componen...

Please sign up or login with your details

Forgot password? Click here to reset