Hash function based on chaotic tent maps
Author:
- 5 July 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
- Vol. 52 (6) , 354-357
Abstract
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.Keywords
This publication has 11 references indexed in Scilit:
- A combined chaotic cryptographic and hashing schemePhysics Letters A, 2003
- A Design Principle for Hash Functions2001
- Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT’912001
- A Secret Key Cryptosystem by Iterating a Chaotic Map2001
- Chaos-based random number generators-part I: analysis [cryptography]IEEE Transactions on Circuits and Systems I: Regular Papers, 2001
- Chaos and cryptography: block encryption ciphers based on chaotic mapsIEEE Transactions on Circuits and Systems I: Regular Papers, 2001
- Cryptography with chaosPhysics Letters A, 1998
- Recent Developments in the Design of Conventional Cryptographic Algorithms1998
- What every computer scientist should know about floating-point arithmeticACM Computing Surveys, 1991
- One Way Hash Functions and DES1990