Advertisement

Exploring Chaotic Neural Network for Cryptographic Hash Function

  • Prateek Singla
  • Payal Sachdeva
  • Musheer Ahmad
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 298)

Abstract

Due to the one way property of neural networks and high sensitivity of chaotic systems, chaotic neural networks make an ideal candidate for cryptographic hash function design. In this paper, a novel algorithm is proposed to construct an efficient cryptographic hash function using a four layer chaotic neural network. The proposed hash function satisfies the security requirements of confusion and diffusion, and the mechanism allows flexibility of the hash value length, which makes it resistant to birthday attack for hash lengths longer than 128 bits. Moreover, the running time of a neural network can be reduced with the help of parallel processing. The statistical analysis of the proposed algorithm proves it to be a promising choice for cryptographic hash function design.

Keywords

Chaotic neural network Hash function Security Chaotic systems 

References

  1. 1.
    Secure Hash Standard (2002) Federal information processing standards publications (FIPS PUBS) 180(2)Google Scholar
  2. 2.
    Vanstone SA, Menezes AJ, Oorschot PC (1996) Handbook of applied cryptography. CRC Press, Boca Raton, FLGoogle Scholar
  3. 3.
    Xiao D, Liao X, Wang Y (2009) Parallel keyed hash function construction based on chaotic neural network. Neurocomputing 72(10):2288–2296CrossRefGoogle Scholar
  4. 4.
    Lian S, Sun J, Wang Z (2006) Secure hash function based on neural network. Neurocomputing 69(16):2346–2350CrossRefGoogle Scholar
  5. 5.
    Wong KW (2003) A combined chaotic cryptographic and hashing scheme. Phys Lett A 307(5–6):292–298CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Yang H, Wong KW, Liao X, Wang Y, Yang D (2009) One-way hash function construction based on chaotic map network. Chaos, Solitons Fractals 41:2566–2574CrossRefGoogle Scholar
  7. 7.
    Wang X, Yin YL, Yu H (2005) Finding collisions in the full SHA-1. LNCS 3621:17–36MathSciNetGoogle Scholar
  8. 8.
    Li S, Chen G, Mou X (2005) On the dynamical degradation of digital piecewise linear chaotic maps. Int J Bifurcat Chaos 15(10):3119–3151CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Akhshani A, Behnia S, Akhavan A, Jafarizadeh MA, Abu Hassan H, Hassan Z (2009) Hash function based on hierarchy of 2D piecewise nonlinear chaotic maps. Chaos, Solitons Fractals 42(4):2405–2412Google Scholar
  10. 10.
    Shannon CE (1949) Communication theory of secrecy systems. Bell Sys Tech J 28:656–715CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Akhavan A, Samsudin A, Akhshani A (2013) A novel parallel hash function based on 3D chaotic map. EURASIP J Adv Signal Process 2013(126)Google Scholar

Copyright information

© Springer India 2014

Authors and Affiliations

  1. 1.Department of Computer Engineering, Faculty of Engineering and TechnologyJamia Millia IslamiaNew DelhiIndia

Personalised recommendations