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 (School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha, China) and Hao Wang (School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha, China)
Copyright: © 2013 |Pages: 12
DOI: 10.4018/jdcf.2013040102
OnDemand PDF Download:
$30.00
List Price: $37.50

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.
Article Preview

1. Introduction

One-way hash function is a fundamental technique for information security, and it is usually applied for integrity protection, digital signatures and message authentication. In the past few years, chaos has been found that it has great potential to be used in the construction of hash function due to its sensitivity to initial conditions and system parameters, ergodicity and random like behavior. Thus, many works have been done on the chaos-based hash functions (Akhavan & Samsudin, 2009; Ren & Wang, 2009; Xiao & Liao, 2008; Zhang &Wang, 2007). Among them, wide attention has been paid to parallel hash function, where the sub-blocks of a message are processed in a parallel mode with high efficiency (Xiao & Liao, 2008). However, cryptanalysis of chaos-based hash functions is also developed very fast. Some chaos-based hash functions also been ben proved to be insecure (Li & Li 2006; Guo & Wang, 2009; Wang & Li, 2012; Wang & Wang, 2008; Wang & Xu, 2010; Wang & Zhao, 2010). Collisions and flaws exist if two or more distinct messages or keys are found to obtain a same hash value, which can be implemented by adversary to fabricate fake messages. For this reason, collision resistance is a basic requirement for a secure hash function.

Recently, a parallel hash function based on chaotic maps with changeable parameters is proposed by Li et al. (2011). Detailed analysis is performed to it, and it is found that it is vulnerable to collision attacks, thus, some measurements of how to improve its security are proposed in this paper.

The rest of the paper is organized as follows. The original algorithm is described and analyzed in the second Section 2, and some improvements are made in Section 3. In Section 4, the experiments and analysis are performed to evaluate the performance of the improved hash function. Finally, some conclusions are drawn in the Section 5.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 10: 4 Issues (2018): 1 Released, 3 Forthcoming
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing