Hash function based on chaotic tent maps
Xun Yi · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · 2005
In cryptographic applications, hash functions are used within digital signature schemes to provide data integrity (e.g., to detect modification of an original message). In this brief, we propose a new 2/spl lscr/ -bit iterated hash function based on chaotic tent maps. This hash function can be expected to have at least the same computational security against target attack, free-start target attack, collision attack, semi-free-start collision attack, and free-start collision attack as DM scheme.