The design of keyed hash function based on CNN-MD structure

Abstract

Listen

Translate article

In this paper, we propose a new chaotic neural network called the Merkle–Damgaard (CNN-MD) iterative structure, which we designed from the perspective of resisting attacks, such as length extension, second original image, Joux multiple collision, and intermediate encounter attacks. A new chaotic hash function based on the CNN-MD is presented. First, CNN is used as the compression function of CNN-MD, which ensures both the unidirectionality of data compression and the sensitivity of the hash value. Furthermore, the multi-input single-output construction of the CNN can achieve highly efficient data compression. In addition, in the process of group encryption of data, we use the value padding of coupled lattice mapping to improve the alignment of the plaintext of the MD algorithm. This new alignment can enhance the hash function’s collision resistance and the CNN-MD sensitivity. Experimental and theoretical analyses show that our proposed hashing algorithm can resist attacks, such as second original image, brute force, and multiple collision attacks, better than MD5, SHA-1, and SHA-2 algorithms. In terms of speed, our proposed hashing algorithm can successfully handle existing commercial scenarios better than MD5, SHA-1, SHA-3, and other methods. Therefore, the hash algorithm proposed in this study can be applied to existing e-commerce scenarios.