Download now Free registration required
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, the authors propose a new hash function (CHA-1) based on chaos, which produces 160-bit hash digest, accepts message length less than 280 bits, and has a security factor 280 of brute-force attack.
- Format: PDF
- Size: 512.8 KB