Parallel Hash function construction based on chaotic maps with changeable parameters |
| |
Authors: | Yantao Li Di Xiao Shaojiang Deng Qi Han Gang Zhou |
| |
Affiliation: | (1) College of Computer Science, Chongqing University, Chongqing, 400044, China;(2) Department of Computer Science, College of William and Mary, Williamsburg, VA, USA |
| |
Abstract: | A parallel Hash algorithm construction based on chaotic maps with changeable parameters is proposed and analyzed in this paper.
The two main characteristics of the proposed algorithm are parallel processing mode and message expansion. The algorithm translates
the expanded message blocks into the corresponding ASCII code values as the iteration times, iterates the chaotic asymmetric
tent map and then the chaotic piecewise linear map, continuously, with changeable parameters dynamically obtained from the
position index of the corresponding message blocks, to generate decimal fractions, then rounds the decimal fractions to integers,
and finally cascades these integers to construct intermediate Hash value. Final Hash value with the length of 128-bit is generated
by logical XOR operation of intermediate Hash values. Theoretical analysis and computer simulation indicate that the proposed
algorithm satisfies the performance requirements of a secure Hash function. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|