Advertisement

Chaotic Integrity Check Value

  • Prathuri Jhansi Rani
  • S. Durga Bhavani
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 192)

Abstract

Chaotic cryptography is slowly emerging as a subfield of cryptography. Many encryption algorithms, secure hash functions and random number generators have been proposed in the literature which are based on well-known chaotic functions. Chaotic keyed hash functions are proposed in the literature but have not been analysed for integrity check value purpose in the literature. We propose a keyed chaotic hash function based on parametrized family of logistic and tent maps and develop a message authentication code (MAC) which outputs a 128 bit message digest(MD).The keyed hash function is designed such that it is resistant to preimage and second preimage attacks. The chaotic hash functions proposed in the literature use a multitude of chaotic maps and we show in this paper that using two chaotic maps judiciously achieves a secure keyed hash function. The proposed keyed hash function is analysed for its sensitivity to the two secret keys that of initial value as well as the parameter value of the family of functions. Experiments in which as the secret keys are infinitesimally changed, the hash value obtained is shown to have nearly 50% of the bits different from the original MD. Further similar experiments are repeated with MD truncated to the first 96 bits, which is the default length for authentication data field in IPSec authentication header and encapsulating security payload. Once again the confusion is shown to be very close to 50%.

Keywords

Hash Function Message Authentication Code Integrity Check Chaotic Neural Network Input Message 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Buchmann, J.A.: Introduction to Cryptography, pp. 247–248. Springer, Heidelberg (2001)CrossRefzbMATHGoogle Scholar
  2. 2.
    Stinson, D.R.: Cryptography: Theory and Practice. CRC Press, Boca Raton (1995)zbMATHGoogle Scholar
  3. 3.
    Stallings, W.: Cryptography and Network Security, Principles and Practice, pp. 493–500. Pearson, London (2004)Google Scholar
  4. 4.
    Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19–35. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 17–36. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Baptista, M.S.: Chaos in cryptography. Phys. Lett. A 240, 50–54 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Taylor, R.: An integrity check value algorithm for stream ciphers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 40–48. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  8. 8.
    Jhansi Rani, P., Sambasiva Rao, M., Durga Bhavani, S.: Design of secure chaotic hash function based on logistic and tent Maps. In: Accepted for Publication in the Proceedings of CNSA-2011. Springer, Heidelberg (2011)Google Scholar
  9. 9.
    Delfs, H., Knebl, H.: Introdution of Cryptography. Springer, Heidelberg (2002)CrossRefzbMATHGoogle Scholar
  10. 10.
    Jiashu, Zhang, Wang, X., Zhang, W.: Chaotic keyed hash function based on feedforward-feedback nonlinear digital filter. Physics Letters A 362, 439–448 (2007)CrossRefzbMATHGoogle Scholar
  11. 11.
    Xiao, D., Liao, X., Wang, Y.: Parallel keyed hash function construction based on chaotic neural network. Neurocomputing 72, 2288–2296 (2009)CrossRefGoogle Scholar
  12. 12.
    Xiao, D., Liao, X.F., Deng, S.J.: One-way hash function construction based on the chaotic map with changeable parameter. Chaos, Solitons & Fractals 24, 65–71 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Yi, X.: Hash function based on chaotic tent maps. IEEE Transactions on Circuits and Systems-II 52, 354–357 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Prathuri Jhansi Rani
    • 1
  • S. Durga Bhavani
    • 1
  1. 1.Department of Computer & Information SciencesUniversity of HyderabadHyderabadIndia

Personalised recommendations