Hash Function Based on Chaotic Tent Maps

IEEE Transactions on Circuits and Systems II: Express Briefs

Volumn 52, Issue 6, 2005, Pages 354-357

  Yi, Xun ^a  

^a VICTORIA UNIVERSITY   (Australia)

Author keywords

Chaotic tent map; cryptography; hash function; secure communication

Indexed keywords

CHAOS THEORY; COMPUTATIONAL METHODS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FUNCTIONS; ITERATIVE METHODS; SECURITY OF DATA; STATISTICAL METHODS; THEOREM PROVING;

CHAOTIC TENT MAP; COMPUTATIONAL SECURITY; DATA INTEGRITY; HASH FUNCTION; SECURE COMMUNICATION;

CRYPTOGRAPHY;

EID: 22244444503     PISSN: 15497747     EISSN: 15583791     Source Type: Journal    
DOI: 10.1109/TCSII.2005.848992     Document Type: Article

References (14)

1. B. Preneel, V. Rijmen, and A. Bosselears, “Recent developments in the design of conventional cryptographic algorithm,” in Lecturer Notes in Computer Science. Berlin, Germany: Springer-Verlag, 1998, vol. 1528, pp. 105–130.
2. T. Habutsu, Y. Nishio, I. Sasase, and S. Mori, “A secret key cryptosystem by iterating a chaotic map,” in Proc. Eurocrypt'91, Brighton, U.K., Apr. 1991, pp. 127–140.
3. G. Jakimoski and L. Kocarev, “Chaos and cryptography: Block encryption ciphers based on chaotic maps,” IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 48, no. 2, pp. 163–169, Feb. 2001.
4. T. Stojanovski and L. Kocarev, “Chaos-based random number generators—Part I: Analysis,” IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 48, no. 3, pp. 281–288, Mar. 2001.
5. M. S. Baptista, “Cryptography with chaos,” Phys. Lett. A, vol. 240, no. 1/2, pp. 50–54, Mar. 1998.
6. K. W. Wong, “A combined chaotic cryptographic and hashing scheme,” Phys. Lett. A, vol. 307, pp. 292–298, 2003.
7. I. B. Damgard, “A design principle for hash functions,” in Proc. Crypto’89, Santa Barbara, CA, Aug. 1989, pp. 416–427.
8. R. C. Merkle, “One way hash functions and DES,” in Proc. Crypto’89, Santa Barbara, CA, Aug. 1989, pp. 428–446.
9. R. Davies and W. Price, “Digital signature—An update,” in Proc. Int. Conf. Computer Communications, Sydney, NSW, Australia, Oct. 1984, pp. 843–847.
10. S. Matyas, C. Meyer, and J. Oseas, “Generating strong one-way function with cryptographic algorithm,” IBM Tech. Disci. Bull., vol. 27, no. 10a, pp. 5658–5659, 1985.
11. “Federal Information Processing Standards Publications,”, Springfield, VA, FIPS PUB 180, May 1993.
12. X. Fai and J. Massey, “Hash functions based on block ciphers,” in Proc. Eurocrypt'92, Hungary, May 1992, pp. 55–70.
13. E. Biham, “Cryptanalysis of the chaotic-map cryptosystem suggested at EUROCRYPT'91,” in Proc. Eurocrypt'91, Brighton, U.K., Apr. 1991, pp. 532–534.
14. D. Goldberg and D. Priest, “What every computer scientist should know about floating-point arithmetic,” ACM Computing Surveys, vol. 23, no. 1, pp. 5–48, 1991.