Abstract
When downloading software from websites located somewhere on the globe, doubt is in place on authenticity and integrity of the software obtained. Fortunately, cryptologic experience has shown that concepts based on digitally signed message digests can ensure integrity and authenticity in web-based software distribution applications.
It is the purpose of this contribution to introduce a novel approach for generating secure hash values (message digests) computed from input data dependent pseudo-random permutations. Essentially, input messages are processed sequentially using bytes of input data as keys to discrete chaotic Kolmogorov systems which permute an initial message digest in a cryptographically strong manner heavily depending on the input stream.
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
V.I. Arnold and A. Avez. Ergodic Problems of Classical Mechanics. W.A. Benjamin, New York, 1968.
Eli Biham and Adi Shamir. Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology-CRYPTO’90 Proceedings, pages 2–21. Springer Verlag, 1991.
W. Diffie and M.E. Hellman. Newd irections in cryptography. IEEE Transactions on Information Theory, 22(6):644–654, 1976.
S. Goldstein, B. Misra, and M. Courbage. On intrinsic randomness of dynamical systems. Journal of Statistical Physics, 25(1):111–126, 1981.
Mitsuru Matsui. Linear cryptanalysis method for DES cipher. In Advances in Cryptology-Eurocrypt’93 Proceedings, pages 386–397. Springer Verlag, 1993.
Jürgen Moser. Stable and Random Motions in Dynamical Systems. Princeton University Press, Princeton, 1973.
US Department of Commerce/NIST. Secure hash standard. FIPS PUB 180-1, April 1995.
National Institute of Standards and Technology. Digital signature standard. U. S. Department of Commerce, 1994.
W.H. Press, B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling. Numerical Recipies in C: The Art of Scientific Computing. Cambridge University Press, 1988.
R.L. Rivest. The MD5 message digest function. RFC 1321, 1992.
R.L. Rivest, A. Shamir, and L.M. Adleman. A method for obtaining digital signatures and public-key cryptsystems. Communications of the ACM, 21(2):120–128, 1978.
Josef Scharinger. Fast encryption of image data using chaotic Kolmogorov flows. Journal of Electronic Imaging, 7(2):318–325, 1998.
Bruce Schneier. Applied Cryptography. Addison-Wesley, 1996.
Paul Shields. The Theory of Bernoulli Shifts. The University of Chicago Press, Chicago, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scharinger, J. (2001). Application of Signed Kolmogorov Hashes to Provide Integrity and Authenticity in Web-Based Software Distribution. In: Moreno-Díaz, R., Buchberger, B., Luis Freire, J. (eds) Computer Aided Systems Theory — EUROCAST 2001. EUROCAST 2001. Lecture Notes in Computer Science, vol 2178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45654-6_21
Download citation
DOI: https://doi.org/10.1007/3-540-45654-6_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42959-3
Online ISBN: 978-3-540-45654-4
eBook Packages: Springer Book Archive