Chaotic hash function based on the dynamic S-Box with variable parameters

Abstract

We present a chaotic hash function based on the dynamic S-Box with variable parameters in this paper. More specifically, we first exploit the piecewise linear chaotic map to obtain four initial buffers and an initial hash value. Then, we divide a randomly chosen message into message blocks and assign the four buffers and current message block to a transfer function to produce variable parameters and initial values of the PWLCM and logistic map for constructing a dynamic S-Box, which is then used for updating the four buffers. After all the message blocks are processed, the final hash value is generated by cascading the buffers and then applying XOR operation with the last hash value. Finally, we conduct performance evaluation on the proposed hash algorithm in terms of sensitivity, confusion and diffusion properties, collision resistances, speed analysis, randomness tests, and comparison with other algorithms, and the results demonstrate that the proposed algorithm has good statistical properties, strong collision resistances and better performance compared with other schemes.

Comparison of Hash Function Algorithms Against Attacks: A Review

“…Li et al [26] used a dynamic S-box to design a chaotic hash function that produces 128-bit hash values as the final hash code and thus compromising its practicability and flexibility lent via the S-box. One major drawback of this proposed algorithm is that the length of the hash code is not enough to guarantee security against collision or second preimage attacks.…”

Chaotic hash function based on circular shifts with variable parameters

“…Birthday attack is an algorithm-independent attack, where a set of random messages are inspected for a possible pair of messages whose hash values collide [49,50]. For an h-bit hash function, the complexity of this attack is about 2 .…”

“…The ideal mean value of the absolute difference for 128-bit hash value is equal to 1360, while our mean value is 1253. [18,34,38,43,49,52,53] in Table 4. As shown in Table 4, the average compression speed of the proposed algorithm (132.07 Mbps) is higher than SHA-1 (114.45 Mbps) and is very close to MD5 (132.10 Mbps).…”

Constructing Keyed Hash Algorithm Using Enhanced Chaotic Map with Varying Parameter

“…Teh et al [13] designed a keyed hash function based on the logistic map with fixed point representation. Li et al designed four 128-bit parallel hash functions based on cross-coupled map lattices [14], tent map [15], circular shifts [16], and dynamic S-box [17] with varying parameters.…”