Advertisement

A Systems Theoretic Approach to the Design of Scalable Cryptographic Hash Functions

  • Josef Scharinger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4739)

Abstract

Cryptographic hash functions are security primitives that compute check sums of messages in a strong manner and this way are of fundamental importance for ensuring integrity and authenticity in secure communications. However, recent developments in cryptanalysis indicate that conventional approaches to the design of cryptographic hash functions may have some shortcomings.

Therefore it is the intention of this contribution to propose a novel way how to design cryptographic hash functions. Our approach is based on the idea that the hash value of a message is computed as a message-dependent permutation generated by very special chaotic permutation systems, so called Kolomogorov systems. Following this systems theoretic approach we obtain arguably strong hash functions with the additional useful property of excellent scalability.

Keywords

Chaotic System Hash Function Message Authentication Code Exponential Divergence Message Block 
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.
    Aigner, M.: Kombinatorik. Springer, Heidelberg (1975)zbMATHGoogle Scholar
  2. 2.
    Arnold, V.I., Avez, A.: Ergodic Problems of Classical Mechanics. W.A. Benjamin, New York (1968)Google Scholar
  3. 3.
    Goldstein, S., Misra, B., Courbage, M.: On intrinsic randomness of dynamical systems. Journal of Statistical Physics 25(1), 111–126 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Golomb, S.W.: Shift Register Sequences. Aegan Park Pr., Laguna Hills, CA (1981)Google Scholar
  5. 5.
    Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, London, UK (1998)Google Scholar
  6. 6.
    Moser, J.: Stable and Random Motions in Dynamical Systems. Princeton University Press, Princeton (1973)zbMATHGoogle Scholar
  7. 7.
    NIST. Keyed-Hash Message Authentication Code (HMAC). FIPS 198 (March 2002)Google Scholar
  8. 8.
    NIST. Secure hash standard (SHS). FIPS 180-2 (August 2002)Google Scholar
  9. 9.
    Rivest, R.L.: The MD5 message digest function. RFC 1321 (1992)Google Scholar
  10. 10.
    Scharinger, J.: An excellent permutation operator for cryptographic applications. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2005. LNCS, vol. 3643, pp. 317–326. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Schneier, B.: Applied Cryptography. Addison-Wesley, London, UK (1996)Google Scholar
  12. 12.
    Shannon, C.E.: Communication theory of secure systems. Bell System Technical Journal 28(4), 656–715 (1949)MathSciNetGoogle Scholar
  13. 13.
    Shields, P.: The Theory of Bernoulli Shifts. The University of Chicago Press, Chicago (1973)zbMATHGoogle Scholar
  14. 14.
    Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, Springer, Heidelberg (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Josef Scharinger
    • 1
  1. 1.Johannes Kepler University, Institute of Computational Perception, 4040 LinzAustria

Personalised recommendations