A dynamic chaotic hash function based upon circle chord methods

Abstract

In this paper a dynamic Hash algorithm construction based on chaotic maps with controllable parameters is proposed and analyzed. Based on simplest 2-D chaotic maps, a new hash function has been proposed and analyzed in this paper. A chaos system also creates a random behavior subsequently, but at the same time a chaos system is wholly deterministic. Moreover in this paper, an algorithm for one way hash function construction based on chaos theory is introduced. The proposed hash function operates on messages with arbitrary length to produce 128 bits hash value and can be easily implemented in both hardware and software. The two core characteristics of the recommended algorithm are chaotic behaviors and parallel processing mode. The proposed algorithm contains controllable parameters dynamically obtained from the position index of the corresponding message blocks. Theoretical analysis and computer simulation indicate that the algorithm can assure all performance conditions of hash function in an efficient and flexible style and secure against several attacks, which is good choice for data integrity or authentication.