×

zbMATH — the first resource for mathematics

Use of chaotic dynamical systems in cryptography. (English) Zbl 0979.94038
Chaotic dynamical systems exhibit some properties that make them quite attractive for possible use in cryptography. A number of proposals have been made to utilize the simulation of chaotic discrete dynamical systems on a computer for encryption. However, mathematical properties relevant to the use of such systems in cryptography have often been neglected. In this paper, some of these properties that may serve to assess the security of such cryptosystems are identified and reviewed.
The paper begins with an introduction to the area; some key problems (e.g. those related to the finiteness of the computer memory in numerical simulations of chaotic dynamical systems) are mentioned there as well. A systematic approach begins in Section 2, where the formal definition of a chaotic dynamical system is given together with some examples. Also the problem of iterating a dynamical system in a discrete and finite context (i.e. on a computer) is discussed here.
In Section 3, sensitivity to the initial conditions and probability distributions are briefly investigated. Results obtained here are subsequently applied in Section 4 to the concept of block and stream ciphers. Properties of some systems proposed in the literature are evaluated and some assessment of their security is given. At the end of the paper, some open research problem are identified.

MSC:
94A60 Cryptography
37D45 Strange attractors, chaotic dynamics of systems with hyperbolic behavior
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Shannon, C.E., Communication theory of secrecy systems, Bell systems tech. J., 28, 656-715, (1949) · Zbl 1200.94005
[2] Massey, J.L., Contemporary cryptology: an introduction, ()
[3] Pecora, L.; Caroll, T., Synchronization in chaotic systems, Phys. rev. lett., 64, 8, 821-824, (1990) · Zbl 0938.37019
[4] Yang, T.; Wu, C.; Chua, L., Cryptography based on chaotic systems, IEE trans. circuits systems — I, 44, 5, 469-472, (1997) · Zbl 0884.94021
[5] He, R.; Vaidya, P., Implementation of chaotic cryptography with chaotic synchronization, Phys. rev. E, 57, 2, 1532-1535, (1998)
[6] Chu, Y.; Chang, S., Dynamical cryptography based on synchronised chaotic systems, Electron. lett., 35, 12, 974-975, (1999)
[7] Papadimitriou, S.; Bezerianos, A.; Bountis, T., Secure communication with chaotic systems of difference equations, IEEE trans. comput., 46, 1, 27-38, (1997)
[8] Chua, L.; Yao, Y.; Yang, Q., Generating randomness from chaos and constructing chaos with desired randomness, Int. J. circuit theory appl., 18, 215-240, (1990)
[9] Matthews, R., On the derivation of a chaotic encryption algorithm, Cryptologia XIII, 1, 29-41, (1989)
[10] T. Habutsu, Y. Nishio, I. Sasase, S. Mori, A secret key cryptosystem by iterating a chaotic map, Proceedings of the EUROCRYPT ’91, Springer, Berlin, 1991, pp.127-140. · Zbl 0766.94011
[11] Kohda, T.; Tsuneda, A., Chaotic bit sequences for stream cipher cryptography and their correlation functions, SPIE proc., 2612, 86-97, (1995)
[12] Hong, Z.; Xieting, L., Generating chaotic secure sequences with desired statistical properties and high security, Int. J. bifurc. chaos, 7, 1, 205-213, (1997) · Zbl 0884.94013
[13] Kotulski, Z.; Szczepanski, J., Discrete chaotic crytography, Ann. phys., 6, 381-394, (1997) · Zbl 0899.94007
[14] Kotulski, Z.; Szczepanski, J.; Gorski, K.; Paszkiewicz, A.; Zugaj, A., Application of discrete chaotic dynamical systems in cryptography — DCC method, Int. J. bifurc. chaos, 9, 6, 1121-1135, (1999) · Zbl 1089.94505
[15] Fridrich, J., Symmetric ciphers based on two-dimensional chaotic maps, Int. J. bifurc. chaos, 8, 6, 1259-1284, (1998) · Zbl 0935.94019
[16] Brown, R.; Chua, L., Clarifying chaos: examples and counter examples, Int. J. bifurc. chaos, 6, 2, 219-249, (1996) · Zbl 0874.58038
[17] Devaney, R.L., An introduction to chaotic dynamical systems, (1989), Addison-Wesley Publishing Company Reading, MA · Zbl 0695.58002
[18] P. Collet, J.-P. Eckmann, Iterated maps of the interval as dynamical systems, Birkhäuser, Basel, 1980. · Zbl 0456.58016
[19] Banks, J.; Cairns, G.; Davis, G.; Stacey, P., On Devaney’s definition of chaos, Am. math. monthly 99, 4, 332-334, (1992) · Zbl 0758.58019
[20] Peitgen, H.O.; Jürgens, H.; Saupe, D., Fractals for the classroom, part 2, (1992), Springer New York · Zbl 0746.58005
[21] Rivlin, T.J., Chebychev polynomials, (1990), Wiley New York
[22] Huber, K., Über anwendungen der tschebyscheffschen polynomen in der schaltungstechnik, Frequenz, 52, 11-13, (1998)
[23] F. Robert, Discrete Iterations, Springer, Berlin, 1986.
[24] Matthews, R.; Wheeler, D., Supercomputer investigations of a chaotic encryption algorithm, Cryptologia XV, 2, 140-152, (1991)
[25] Coven, E.; Kan, I.; Yorke, J.A., Pseudo-orbit shadowing in the family of tent maps, Trans. amer. math. soc. 308, 1, 227-241, (1988) · Zbl 0651.58032
[26] H.G. Schuster, Deterministic Chaos, Wiley/VCH, 1995.
[27] Ulam, S.; Neumann, J.v., On combinations of stochastic and deterministic processes, Bull. am. math. soc., 53, 1120, (1947)
[28] Adler, R.L.; Rivlin, T.J., Ergodic and mixing properties of Chebychev polynomials, Proc. am. math. soc., 15, 794-796, (1964) · Zbl 0124.06705
[29] E. Biham, Cryptanalysis of the chaotic-map cryptosystem suggested at EUROCRYPT’91, Proceedings of the EUROCRYPT ’91, Springer, Berlin, 1991, pp. 532-534. · Zbl 0825.94182
[30] F. Pichler, J. Scharinger, Ciphering by Bernoulli shifts in finite abelian groups, in Contributions to General Algebra, Proceedings of the Linz-Conference, Vienna, pp. 465-476. · Zbl 0899.94008
[31] T. Kohda, A. Tsuneda, Explicit evaluation of correlation functions of Chebyshev binary and bit sequences based on Perron-Frobenius-operator, IEICE Trans. Fund. Electron. Comm. Comput. Sci. E77-A (11) (1994) 1794-1800.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.