A Systems Theoretic Approach to the Design of Scalable Cryptographic Hash Functions
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.
KeywordsChaotic System Hash Function Message Authentication Code Exponential Divergence Message Block
Unable to display preview. Download preview PDF.
- 2.Arnold, V.I., Avez, A.: Ergodic Problems of Classical Mechanics. W.A. Benjamin, New York (1968)Google Scholar
- 4.Golomb, S.W.: Shift Register Sequences. Aegan Park Pr., Laguna Hills, CA (1981)Google Scholar
- 5.Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, London, UK (1998)Google Scholar
- 7.NIST. Keyed-Hash Message Authentication Code (HMAC). FIPS 198 (March 2002)Google Scholar
- 8.NIST. Secure hash standard (SHS). FIPS 180-2 (August 2002)Google Scholar
- 9.Rivest, R.L.: The MD5 message digest function. RFC 1321 (1992)Google Scholar
- 11.Schneier, B.: Applied Cryptography. Addison-Wesley, London, UK (1996)Google Scholar
- 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