Home > Papers

 
 
Parallel hash function using DM-based integer-valued chaotic maps network
Liao Dong 1 #,Wang Xiaomin 2 *
1.School of Information Science and Technology, Southwest Jiaotong University, ChengDu 610031
2.School of Information Science andchnology, Southwest Jiaotong University, Chengdu 610031
*Correspondence author
#Submitted by
Subject:
Funding: The Excellent Youth Foundation of Sichuan Province （No.No. 2011JQ0027）, The National Natural Science Foundation of China （No.Nos. 60903202, 61003245）, The Basic Science Foundation of Southwest Jiaotong University （No.No. 2008B08）, The Specialized Research Fund for the Doctoral Program of Higher Education of China （No.No. 20090184120024）, The Fundamental Research Funds for the Central Universities （No.Nos. SWJTU11CX041, SWJTU12CX099）
Opened online:17 December 2012
Accepted by: none
Citation: Liao Dong,Wang Xiaomin.Parallel hash function using DM-based integer-valued chaotic maps network[OL]. [17 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4500967
 
 
A parallel hash function using DM-based integer-valued chaotic maps network is proposed which combines the advantage of both chaotic system and DM scheme. And the algorithm has avoided the flaw of the forgery attack of the exiting parallel hash functions. The algorithm can be used to calculate hash values of 128, 160, 192, 256, 384 and 512 bits with little difference in performance for the different hash values. The message is partitioned into message blocks with fixed length and each message block is processed by the integer-valued chaotic maps network in parallel. The final hash value is generated with a sponge-like construction， which confuses the mixed result of all the outputs of the integer-valued chaotic maps network. The hash function is mainly implemented by extend integer-valued tent maps and can work in a parallel mode, which guarantees good security and high efficiency. Theoretical and simulation results show that the proposed hash algorithm has strong diffusion and confusion capability and good collision resistance. These properties make it a good candidate for hash on platforms that support parallel processing.
Keywords:Chaotic system; hash function; parallel; sponge-like construction
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 329
Bookmarked 0
Recommend 5
Comments Array
Submit your papers