Abstract
Permutations are a core component of almost every cipher. No matter if we consider the DES, AES or most of the other encryption algorithms relevant nowadays, we always find permutation operators as essential building blocks inside. In this contribution we will introduce key-dependent permutation operators of provably excellent quality inspired by chaotic Kolmogorov flows.
From chaotic systems theory it is known that the class of Kolmogorov flows exhibits the highest degree of instability among all dynamical systems. As will be derived and proven in detail in this paper, these outstanding properties make them a perfect inspiration for developing a novel class of strong cryptographic permutation operators.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnold, V.I., Avez, A.: Ergodic Problems of Classical Mechanics. W.A. Benjamin, New York (1968)
Dixon, R.: Spread Spectrum Systems. John Wiley and Sons, New York (1984)
Goldstein, S., Misra, B., Courbage, M.: On intrinsic randomness of dynamical systems. Journal of Statistical Physics 25(1), 111–126 (1981)
Hartung, F., Su, J., Girod, B.: Spread spectrum watermarking: Malicious attacks and counterattacks. In: Security and Watermarking of Multimedia Contents, Proc. SPIE 3657 (January 1999)
Kutter, M.: Performance improvement of spread spectrum based image watermarking schemes through m-ary modulation. In: IH 1999. LNCS, vol. 1768, pp. 238–250. Springer, Heidelberg (1999)
Moser, J.: Stable and Random Motions in Dynamical Systems. Princeton University Press, Princeton (1973)
NIST. Digital signature standard. U. S. Department of Commerce (1994)
NIST. Secure hash standard. FIPS PUB 180-1 (April 1995)
Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipies in C: The Art of Scientific Computing. Cambridge University Press, Cambridge (1988)
Scharinger, J.: Fast encryption of image data using chaotic Kolmogorov flows. Journal of Electronic Imaging 7(2), 318–325 (1998)
Scharinger, J.: Analysis of chaotic systems for communication security applications. In: Proceedings of the 14th International Conference on Systems Science, vol. 3, pp. 78–85 (2001)
Scharinger, J.: Application of signed Kolmogorov hashes to provide integrity and authenticity in web-based software distribution. In: Formal Methods and Tools for Computer Science, pp. 85–88 (2001)
Schneier, B.: Applied Cryptography. Addison-Wesley, Reading (1996)
Tirkel, A.Z., Rankin, G.A., van Schyndel, R.G., Ho, W.J., Mee, N.R.A., Osborne, C.F.: Electronic watermark. In: Dicta 1993, pp. 666–672 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scharinger, J. (2005). An Excellent Permutation Operator for Cryptographic Applications. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2005. EUROCAST 2005. Lecture Notes in Computer Science, vol 3643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556985_42
Download citation
DOI: https://doi.org/10.1007/11556985_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29002-5
Online ISBN: 978-3-540-31829-3
eBook Packages: Computer ScienceComputer Science (R0)