Collision Analysis and Improvement of a Parallel Hash Function based on Chaotic Maps with Changeable Parameters
Min Long and
Additional contact information
Min Long: School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha, China
Hao Wang: School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha, China
International Journal of Digital Crime and Forensics (IJDCF), 2013, vol. 5, issue 2, 23-34
Recently, a parallel hash function based on chaotic maps with changeable parameters was proposed by Li et al (2011, pp.1305-1312). In this paper, the security of it is analyzed and the weakness of the architecture is pointed out. It is found that the main limitations are the error using of floor, round and exclusive OR operations in the algorithm. In order to counterstrike these, some improvements are done to strength its security. Theoretical analysis and experimental results illustrate that the improved Hash function is more secure and practical than the original one.
References: Add references at CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jdcf.2013040102 (application/pdf)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:igg:jdcf00:v:5:y:2013:i:2:p:23-34
Access Statistics for this article
More articles in International Journal of Digital Crime and Forensics (IJDCF) from IGI Global
Bibliographic data for series maintained by Journal Editor ().