Welcome to the InfoSci Platform
Reference Hub2
Collision Analysis and Improvement of a Parallel Hash Function based on Chaotic Maps with Changeable Parameters

Collision Analysis and Improvement of a Parallel Hash Function based on Chaotic Maps with Changeable Parameters

Min Long, Hao Wang
Copyright: © 2013 |Volume: 5 |Issue: 2 |Pages: 12
ISSN: 1941-6210|EISSN: 1941-6229|EISBN13: 9781466632547|DOI: 10.4018/jdcf.2013040102
Cite Article Cite Article

MLA

Long, Min, and Hao Wang. "Collision Analysis and Improvement of a Parallel Hash Function based on Chaotic Maps with Changeable Parameters." IJDCF vol.5, no.2 2013: pp.23-34. http://doi.org/10.4018/jdcf.2013040102

APA

Long, M. & Wang, H. (2013). Collision Analysis and Improvement of a Parallel Hash Function based on Chaotic Maps with Changeable Parameters. International Journal of Digital Crime and Forensics (IJDCF), 5(2), 23-34. http://doi.org/10.4018/jdcf.2013040102

Chicago

Long, Min, and Hao Wang. "Collision Analysis and Improvement of a Parallel Hash Function based on Chaotic Maps with Changeable Parameters," International Journal of Digital Crime and Forensics (IJDCF) 5, no.2: 23-34. http://doi.org/10.4018/jdcf.2013040102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.