Secure hash function based on chaotic tent map with changeable parameter

A new algorithm for a novel hash function, based on chaotic tent map with changeable parameter, is proposed and analyzed. The one dimensional and piecewise tent map with changeable parameters decided by the position index of blocked messages is chosen, and blocked massages translated into ASCII code values are employed as the iteration time of the chaotic tent map. The final 128-bit hash value is generated by logical XOR operation on intermediate hash values. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash function. the largest Lyapunov exponent. In the same year, Yang, et al. (10) proposed a method of one-way hash function construction based on chaotic map network. We (11) employed a novel combined cryptographic and hash algorithm based on chaotic control character, and Xiao, et al. (12) first proposed a parallel keyed hash function construction based on chaotic neural network in 2009.