New Hash Function Based on Chaos Theory (CHA-1)

Summary Cryptographic hash function has been used extensively in many cryptographic protocols. Many of the hash functions generate the message digest thru a randomizing process of the original message. Subsequently a chaos system also generates random behavior, but at the same time a chaos system is completely deterministic. In this paper, we propose a new hash function (CHA-1) based on chaos, which produces 160-bit hash digest, accepts message length less than 2 80 bits, and has a security factor 2 80 of brute-force attack.