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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aigner, M.: Kombinatorik. Springer, Heidelberg (1975)
Arnold, V.I., Avez, A.: Ergodic Problems of Classical Mechanics. W.A. Benjamin, New York (1968)
Goldstein, S., Misra, B., Courbage, M.: On intrinsic randomness of dynamical systems. Journal of Statistical Physics 25(1), 111–126 (1981)
Golomb, S.W.: Shift Register Sequences. Aegan Park Pr., Laguna Hills, CA (1981)
Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, London, UK (1998)
Moser, J.: Stable and Random Motions in Dynamical Systems. Princeton University Press, Princeton (1973)
NIST. Keyed-Hash Message Authentication Code (HMAC). FIPS 198 (March 2002)
NIST. Secure hash standard (SHS). FIPS 180-2 (August 2002)
Rivest, R.L.: The MD5 message digest function. RFC 1321 (1992)
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)
Schneier, B.: Applied Cryptography. Addison-Wesley, London, UK (1996)
Shannon, C.E.: Communication theory of secure systems. Bell System Technical Journal 28(4), 656–715 (1949)
Shields, P.: The Theory of Bernoulli Shifts. The University of Chicago Press, Chicago (1973)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scharinger, J. (2007). A Systems Theoretic Approach to the Design of Scalable Cryptographic Hash Functions. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2007. EUROCAST 2007. Lecture Notes in Computer Science, vol 4739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75867-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-75867-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75866-2
Online ISBN: 978-3-540-75867-9
eBook Packages: Computer ScienceComputer Science (R0)