Advertisement

Neural Computing and Applications

, Volume 20, Issue 8, pp 1305–1312 | Cite as

Parallel Hash function construction based on chaotic maps with changeable parameters

  • Yantao LiEmail author
  • Di Xiao
  • Shaojiang Deng
  • Qi Han
  • Gang Zhou
Original Article

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

Chaos Asymmetric tent map Piecewise linear map Parallel processing mode Changeable parameter 

Notes

Acknowledgments

Our sincere thanks go to the anonymous reviewers for their valuable comments. The work described here was supported by the Fundamental Research Funds for the Central Universities (Grant No. CDJXS10182215), the National Natural Science Foundation of China (Grant Nos. 61070246, 61003247, 60873201), the Program for New Century Excellent Talents in University of China (NCET-09-0838, NCET-08-0603), the Natural Science Foundation Project of CQ CSTC (Grant Nos. 2010BB2047, 2009BB2211).

References

  1. 1.
    Rivest RL (1991) The MD4 message digest algorithm. Springer, Berlin, pp 303–311Google Scholar
  2. 2.
    Rivest RL (1992) The MD5 message digest algorithm. Request for Comments: 1321. MIT Laboratory for Computer Science and RSA Data Security, IncGoogle Scholar
  3. 3.
    Baptista MS (1998) Cryptography with chaos. Phys Lett A 240:50–54MathSciNetCrossRefGoogle Scholar
  4. 4.
    Wong KW (2003) A combined chaotic cryptographic and Hashing scheme. Phys Lett A 307:292–298MathSciNetCrossRefGoogle Scholar
  5. 5.
    Xiao D, Liao XF, Deng SJ (2005) One-way Hash function construction based on the chaotic map with changeable-parameter. Chaos Solitons Fractals 24:65–71MathSciNetGoogle Scholar
  6. 6.
    Yi X (2005) Hash function based on chaotic tent maps. IEEE Trans Circuits Syst II Express Briefs 52:354–357CrossRefGoogle Scholar
  7. 7.
    Lian SG, Sun JS, Wang ZQ (2006) Secure Hash function based on neural network. Neurocomputing 69:2346–2350CrossRefGoogle Scholar
  8. 8.
    Zhang JS, Wang XM, Zhang WF (2007) Chaotic keyed Hash function based on feedforward–feedback nonlinear digital filter. Phys Lett A 362:439–448CrossRefGoogle Scholar
  9. 9.
    Wang Y, Liao XF, Xiao D, Wong KW (2008) One-way Hash function construction based on 2D coupled map lattices. Inform Sci 178:1391–1406CrossRefGoogle Scholar
  10. 10.
    Yang HQ, Wong KW, Liao XF, Wang Y, Yang DG (2009) One-way Hash function construction based on chaotic map network. Chaos Solitons Fractals 41:2566–2574CrossRefGoogle Scholar
  11. 11.
    Deng SJ, Li YT, Xiao D (2009) Analysis and improvement of a chaos-based Hash function construction. Commun Nonlinear Sci Numer Simulat 15:1338–1347MathSciNetCrossRefGoogle Scholar
  12. 12.
    Li YT, Deng SJ, Xiao D (2011) A novel Hash algorithm construction based on chaotic neural network. Neural Comput Appl 20:133–141Google Scholar
  13. 13.
    Li YT, Xiao D, Deng SJ (2010) Hash function based on the chaotic look-up table with changeable parameter. Intern J Modern Phys B (In press)Google Scholar
  14. 14.
    Xiao D, Liao XF, Deng SJ (2008) Parallel keyed Hash function construction based on chaotic maps. Phys Lett A 372:4682–4688MathSciNetCrossRefGoogle Scholar
  15. 15.
    Xiao D, Liao XY, Wong KW (2006) Improving the security of a dynamic look-up table based chaotic cryptosystem. IEEE Trans Circuits Sys II Express Briefs 53:502–506CrossRefGoogle Scholar
  16. 16.
    Zhang CN, Lai CR (2004) A systematic approach for encryption and authentication with fault tolerance. Comput Netw 45:143–154CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  • Yantao Li
    • 1
    • 2
    Email author
  • Di Xiao
    • 1
  • Shaojiang Deng
    • 1
  • Qi Han
    • 1
  • Gang Zhou
    • 2
  1. 1.College of Computer ScienceChongqing UniversityChongqingChina
  2. 2.Department of Computer ScienceCollege of William and MaryWilliamsburgUSA

Personalised recommendations