.png){kind=icon}
.png){kind=icon}
Return
Parallel cryptographic hash function based on cellular automata and random diffusion model
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2024.112546.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The development of a cryptographic hash algorithm is a crucial task due to its numerous practical applications, such as digital signatures, blockchain, and distributed systems. Constructing a novel and efficient hash algorithm that meets the high security requirements is a challenging endeavor. This study introduces a cryptographic parallel hash algorithm based on cellular automata (CA) and a stochastic diffusion model, referred to as PCASD. The article delves into the rules of cellular automata, classifies 88 types of equivalent class rules, and utilizes random chaotic rules to generate keys for iterative processes. The random diffusion model optimizes parameters to achieve optimal safety performance indicators. The parallel iteration structure allows for simultaneous execution of different branches, ultimately resulting in a hash value. The experimental results demonstrate that the proposed parallel hash algorithm outperforms popular hash functions in terms of randomness, avalanche, information entropy, collision resistance, and efficiency, indicating its practical feasibility.
Keywords:
Cryptographic hash algorithm
Random diffusion model
Cellular automata
Collision-resistance
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W