Professional Documents
Culture Documents
Communication Through Chaotic Map Systems: P. García, J. Jiménez
Communication Through Chaotic Map Systems: P. García, J. Jiménez
Communication Through Chaotic Map Systems: P. García, J. Jiménez
Abstract
A common feature in the most recent developments of chaos-based communication systems is the use of a single dynamical
rule through the encoding–decoding process. Regarding security, this fact could make the system vulnerable to systematic
attack from cryptanalists. In this Letter we introduce a communication system based on the symbolic dynamics of a set of
chaotic systems instead of a single one and investigate in what extent this increases security. 2002 Elsevier Science B.V. All
rights reserved.
PACS: 05.45.Vx
crypted by codifying it as the initial value from which A way to represent the trajectories of a system
the system generates the subsequence. Another idea evolving under this regime consists in recording the
proposed by Baptista in [3] suggests to encrypt the coordinates of the points visited by the orbit in its
subsequence as the number of iterations required by phase space at each instant of time. Alternatively, by
the system to generate the subsequence from a given choosing a suitable discretization of the attractor, tra-
initial condition. In other works [7,8], the encoding jectories can be represented by sequences of sym-
process is achieved by using the fact that the chaotic bols [9]. This discretization consists in dividing the at-
orbits can be controlled by using small perturbations. tractor in a finite number of regions and assigning to
In this case, the system is perturbed in such way that each region a symbol from some alphabet. Then it is
its symbolic dynamics generates the subsequences of possible to assign to each point visited by the orbit the
the message. symbol associated to the region where the point lies.
A common feature in the above and other method- This procedure allows us to go from an orbit consist-
ologies is the use of a single dynamical system in ing of a sequence represented by infinitely many sym-
the ciphering process [1–8], so although this selection bols to another orbit represented just by a few symbols.
simplifies the procedure, it also creates restrictions and This symbolic representation results in a loss of many
makes the encoding–decoding system vulnerable to at- details about the dynamics; however, some essential
tacks from unauthorized interceptors [10–15]. In addi- features are kept, for example, the aperiodic character
tion, it seems naive to expect the modeling a language shown by the chaotic orbit is preserved by its symbolic
using only one dynamical system. With these motiva- representation.
tions, in the present Letter we show some results ob- In our case, we are interested in a family of chaotic
tained when a family of chaotic systems is involved systems whose symbolic dynamic can generate words
in the process of encoding–decoding. Specifically, we from any written message.
analyze the security level of the scheme against unau- Without loss of generality, any of message written
thorized interceptors. using symbols from any alphabet can be rewritten in
Each element of our family of chaotic systems binary form. In order to generate this binary message
depends on three independent parameters that can be we choose a priori a map whose symbolic dynamics
always chosen in a manner that there are no forbidden allows all the possible first-order transitions. By allow-
transitions in the generation of symbols. Each map ing this, the pairs 00, 01, 10 and 11 that are generated
is entrusted the ciphering–deciphering of a part of by the dynamics can be represented by the new sym-
the message, which is assigned by means of a secret bols q1 , q2 , q3 and q4 . The admission of any first-order
key. transition in the new symbols makes transitions of or-
In Section 2 we describe a method to represent the der greater than one possible in the binary chain.
trajectories of chaotic dynamical systems through se- We choose particular map in agreement with these
quences of symbols and, conversely, we show a proce- features and possessing a very simple structure is a
dure to associate a real number to a chain of symbols. piecewise linear map f : I → I , given by
In Section 3 we report a scheme for the construction
of a cipher–decipher system based on the symbolic dy- f1 (xn ) if xn ∈ I1 ,
namics of a family of piecewise linear chaotic transfor- f2 (xn ) if xn ∈ I2 ,
xn+1 = (1)
mations. Section 4 presents the main results which are
f3 (xn ) if xn ∈ I3 ,
related to security and, finally, in Section 5 we present f4 (xn ) if xn ∈ I4 ,
some concluding remarks.
where fi (xn ) = pi xn − si and 4i=1 Ii = [0, 1]. Here
I1 , I2 and I3 represent the independent parameters and
since fi (Ii ) = I , pi and si can be calculated from {Ii },
2. Symbolic dynamic of chaotic systems
using
Random-like oscillations in deterministic systems
1
i
described by nonlinear differential or difference equa- pi = , si = 1 − pi Ii . (2)
tions are called chaos. Ii
n=1
P. García, J. Jiménez / Physics Letters A 298 (2002) 35–40 37
S = {8, 3, 7, 7, 9, 1, 3, . . .}.
With this key, we apply the encoding procedure over 5. Conclusions
the message. The ciphertext obtained is
0.667202 0.826402 0.905744 0.954064 We have presented a communication system based
0.666879 0.534888 0.952387. on the symbolic dynamics of a family of piecewise
linear chaotic maps.
Subsequently, the decoding scheme is used on this In contrast with methods that require control of
ciphertext, and the decoded message is a chaotic system, the encoding and decoding in our
method are achieved by repeating a very simple cal-
Communication Through Chaotic Map
culation.
Systems.
This idea presents another desirable features such
as (i) simple implementation, (ii) the encoding and
decoding is done by the same system, (iii) low cost
4. Main results
of hardware implementation, (iv) fast encryption and
decryption, and (v) a reasonable degree of security.
With respect to security, when we study the effects
of parameters mismatch, we observe that slight differ-
ences (about 10−4 ) between the value of the parame-
ters of the transmitter and the receiver produce the fol- Acknowledgement
lowing decoded message:
Cn \mZi\d1QOn[FYot/5+Yh ∼ g?{ ?; This research was partially supported by Consejo
de Desarrollo Científico y Humanístico, Universidad
P|SyXwubq∼ .
Central de Venezuela.
This sensitivity to small variations about the correct
parameters is a desirable property regarding the secu-
rity of the encoding–decoding system. As a measure of References
security against unauthorized decryption, we can esti-
mate an upper bound of the work required for an ex-
[1] E. Bollt, Y.C. Lai, Phys. Rev. E 58 (1998) 1724.
haustive search of the key, under the assumption that [2] E. Alvarez, A. Fernández, P. García, J. Jiménez, A. Marcano,
the strategy of encryption is known (Shanon’s maxim: Phys. Lett. A 263 (1999) 373.
“The enemy knows the system being used”). [3] M.S. Baptista, Phys. Lett. A 240 (1998) 50.
40 P. García, J. Jiménez / Physics Letters A 298 (2002) 35–40
[4] T. Habutsu, Y. Nishio, I. Sasase, S. Mori, in: Advances in [10] E. Biham, in: Advances in Cryptology, Proceedings of EURO-
Cryptology, Proceedings of EUROCRYPT ’91, Lecture Notes CRYPT ’91, Lecture Notes in Computer Science, 1991.
in Computer Science, 1991, pp. 127–140. [11] K.M. Short, Int. J. Bifurc. Chaos 6 (1996) 367.
[5] M.S. Baptista, E. Rosa, C. Grebogi, Phys. Rev. E 61 (2000) [12] T. Yang, L.-B. Yang, C.-M. Yang, Phys. Lett. A 247 (1998)
3590. 105.
[6] M.S. Baptista, E.E. Macau, C. Grebogi, Y.C. Lai, E. Rosa Jr., [13] T. Yang, L.-B. Yang, C.-M. Yang, Phys. Lett. A 245 (1998)
Phys. Rev. E 62 (2000) 4835. 495.
[7] S. Hayes, C. Grebogi, E. Ott, A. Mark, Phys. Rev. Lett. 73 [14] C. Zhou, C.H. Lai, Phys. Rev. E 59 (1999) 6629.
(1994) 1781. [15] G. Alvarez, F. Montoya, M. Romera, G. Pastor, Phys. Lett.
[8] Y.C. Lai, E. Bollt, C. Grebogi, Phys. Lett. A 255 (1999) 75. A 276 (2000) 191.
[9] B.-L. Hao, Applied Symbolic Dynamics and Chaos, World
Scientific, 1998.