Open Access
A
A new hash function inspired by sponge construction using chaotic maps
*Amine ZellaguiCorresponding authoramine.zellagui@univ-usto.dzLaboratory of Coding and Information Security University of the Sciences and the Technology of Oran Mohamed Boudiaf USTO-MB, P. O. Box 505 El M’Naouer Oran 31000 AlgeriaView full profile → , Naima Hadj-Saidnaima.hadjsaid@univ-usto.dzLaboratory of Coding and Information Security University of the Sciences and the Technology of Oran Mohamed Boudiaf USTO-MB, P. O. Box 505 El M’Naouer Oran 31000 AlgeriaView full profile → , Adda Ali-Pachaadda.alipacha@univ-usto.dzLaboratory of Coding and Information Security University of the Sciences and the Technology of Oran Mohamed Boudiaf USTO-MB, P. O. Box 505 El M’Naouer Oran 31000 AlgeriaLoboratory of Coding and Security of Information University of Sciences and Technology of Oran Mohamed Boudiaf P. O. Box 1505 El M’Naouer Oran, 31000, AlgeriaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Jan 2021
- Accepted:
- 05 May 2021
- Published Online:
- 08 Mar 2022
- Article type:
- A
- Language:
- EN
- Article no.:
- JDMSC-1420
- Pages:
- 529–559
Abstract
This paper presents a new secure hash function structure inspired by the sponge construction for hash functions. It is designed to avoid the length of the extension attack, multi-collisions attack, and other vulnerabilities that have been found for many of the hash functions based on the older Merkle Damgård construction. The proposed hash function generates a variable-size hash code. It uses three nonlinear functions that generate chaotic maps: Zaslavsky 2D maps, logistic maps, and Henon maps. Other operations include XOR, rotation, multiplication, and addition. The proposed scheme has a high sensitivity to the initial conditions and message, strong and stable diffusion and confusion capabilities, as well as flexibility in terms of hash size and number of rounds.
Keywords
Subject Classifications
94A6294A6068P2511K4581P9437D45
References
- Rivest R., 1992, “The MD4 Message-Digest Algorithm,” RFC 1320, MIT LCS and RSA Data Securit y, Inc [Crossref], [Google Scholar]
- Rivest R., 1992, “The MD5 Message-Digest Algorithm,” RFC 1321, MIT LCS and RSA Data Securit y, Inc [Crossref], [Google Scholar]
- Dobbertin, H., Bosselaers, A., & Preneel, B. (1996, February). RIPEMD-160: A strengthened version of RIPEMD. In International Workshop on Fast Software Encryption (pp. 71-82). Springer, Berlin, Heidelberg. [Crossref], [Google Scholar]
- Zheng, Y., Pieprzyk, J., Seberry, J., HAVAL - A One-Way Hashing Algorithm with Variable Length of Output. In: ASIACRYPT 1992. LNCS, pp. 83–104. Springer, Heidelberg (1992) [Google Scholar]
- Wang, X., Feng, D., Lai, X., & Yu, H. (2004). Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptologye Print Archive, report 2004/199 [Google Scholar]
- Eastlake, D. 3rd, & Jones, P. (2001). RFC3174: Us secure hash algorithm 1 (SHA1). Internet RFCs, [Crossref], [Google Scholar]
- Stevens, M., Bursztein, E., Karpman, P., Albertini, A., & Markov, Y. (2017, August). The first collision for full SHA-1. In Annual International Cryptology Conference (pp. 570-596). Springer, Cham. [Crossref], [Google Scholar]
- Eastlake, D., & Hansen, T. (2006). US secure hash algorithms (SHA and HMAC-SHA). RFC 4634 (Informational), Internet Engineering Task Force, Jul. 2006. [Online]. Available: http://www.ietf.org/rfc/rfc4634.txt [Crossref], [Google Scholar]
- Merkle, R. C. (1989, August). A certified digital signature. In Conference on the Theory and Application of Cryptology (pp. 218-238). Springer, New York, NY. [Google Scholar]
- Damgård, I. B. (1989, August). A design principle for hash functions. In Conference on the Theory and Application of Cryptology (pp. 416-427). Springer, New York, NY. [Google Scholar]
- G.M. Zaslavsky (1978). “The Simplest case of a strange attractor”. Phys. Lett. A. 69 (3): 145–147. Bibcode: 1978PhLA … 69. 145Z. doi:https://doi.org/10.1016/0375-9601(78)90195-0. [Crossref], [Web of Science ®], [Google Scholar]
- May, Robert M. (1972-08-18). “Will a Large Complex System be Stable?”. Nature. 238 (5364): 413–414. Bibcode:1972Natur. 238.413M. doi:https://doi.org/10.1038/238413a0. [Crossref], [PubMed], [Web of Science ®], [Google Scholar]
- M. Hénon (1976). “A two-dimensional mapping with a strange attractor”. Communications in Mathematical Physics. 50 (1): 69–77. doi:https://doi.org/10.1007/BF01608556. [Crossref], [Web of Science ®], [Google Scholar]
- Shannon, C. E. (1949). Communication theory of secrecy systems. Bell Systems Technical Journal, 28, 656–715 [Crossref], [Google Scholar]
- Kanso, A., Yahyaoui, H., & Almulla, M. (2012). Keyed hash function based on a chaotic map. Information Sciences, 186(1), 249-264. [Crossref], [Web of Science ®], [Google Scholar]
- Lin, Z., Guyeux, C., Yu, S., Wang, Q., & Cai, S. (2019). On the use of chaotic iterations to design keyed hash function. Cluster Computing, 22(1), 905-919. [Crossref], [Google Scholar]
- Ahmad, M., Khurana, S., Singh, S., & AlSharari, H. D. (2017). A simple secure hash function scheme using multiple chao
Views: 257Downloads: 6Citations: 4
