.png){kind=icon}
.png){kind=icon}
Return
Novel cryptographic hash function based on multiple compressive parallel structures
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-022-07504-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As a fundamental cryptographic primitive, hash function is used in various cryptographic applications, such as cloud storage, digital signature, block chain and random number generation. Although hash function has made great achievements in recent years, most of the existing schemes are designed by serial architectures which suffer from huge time consumption. From an efficiency perspective, this paper discusses different forms of optimality that can be constructed by designing parallel structure in hash scheme. Moreover, without affecting the optimal efficiency, in order to accelerate message diffusion and avalanche effect, the corresponding iterative structure and compressive function are slightly optimized. The simulation results show the proposed hash scheme has great performance on both efficiency and security, comparing to other benchmark parallel hash functions, the proposed structure is increased 15% in efficiency, which can be used in substitution of classic hash functions.
Keywords:
Hash function
Parallel structure
Compression function
Collision-resistance
Avalanche effect