CHAOS

e-ISSN: 2687-4539
EDITORIAL
Vol.5 / No.3 / 2023 / pp.133-140
Theory and Applications
in Applied Sciences and Engineering

Are Chaotic Attractors just a Mathematical Curiosity or

Do They Contribute to the Advancement of Science?
René Lozi ID ∗,1
∗ LJAD, CNRS, Université Côte d’Azur, F-06000 Nice, France.

ABSTRACT Since the seminal work of Henri Poincaré on the three-body problem, and more recent research KEYWORDS
dating back to the second half of the 20th century on chaotic dynamical systems, many applications have Chaotic attrac-
emerged in different domains (economics, electronic, cryptography, physics, etc). We try to describe the tors
evolution of the last 50 years on the subject and to find out whether applications have compromised the purity Optimization
and beauty of theoretical research. Cryptography
Memristor
Economy

INTRODUCTION
Since the very beginning of their appearance in the history of later. This is the reason why I often ask myself the question of the
humanity, research in mathematics has been guided by two place of these attractors not only in mathematics, but also for the
different currents: theory and applications or in other words advancement of science.
by beauty and utility. Around 5,000 years ago people in the
Mesopotamia and Egypt began using arithmetic, algebra and It is widely accepted that the beginning of modern research on
geometry for commerce, trade, taxation and social activities. nonlinear dynamical systems is due to the initial work of Henri
Later, in the 6th century BC, Greeks introduced mathematics as Poincaré on the three-body problem. Even if a real astronomical
a "demonstrative discipline" (Heath 1931) (see (Høyrup J. 2011) problem (will the Earth continue to orbit around the sun forever?)
for comparison between both approaches). This double current of is at the origin of his reflection, no practical application of his
research still functions today in competition-cooperation mode. "Méthodes nouvelles de la mécanique céleste" has guided his mind.

I had the immense privilege of being student of Jean Alexandre The "butterfly effect" reveled by Edward Lorenz in 1963
Dieudonné, one of the founding members of the Bourbaki group. (Lorenz, E. N. 1963) and the "sexier" word "chaos" coined by James
For him, the only need to research mathematics for humanity was A. Yorke in 1975 (Li, T. Y. and Yorke, J. A. 1975) have brought
"for the honor of the human spirit" (as the great mathematician global awareness of these concepts often not actually understood
Karl Gustav Jacobi 1804-1851 said before him). by the public. However, it is only at the beginning of 90’ that
the applications of chaotic properties of dynamical systems were
As a young student, I was imbued with this idea, but I was also introduced with the pioneering idea of synchronization of two
attracted by research in physics and ultimately my university ca- chaotic attractors of Louis M. Pecora and Thomas L. Carroll
reer was that of professor of numerical analysis. The subject of my (Pecora, L. M. and Carroll, T. L. 1990). Such concept was soon
doctoral thesis concerned the numerical analysis of bifurcations, used (and improved) to transmit encrypted messages.
which quickly led me to study chaotic dynamic systems from
both aspects: theory and application. I was fortunate to see the Since then, many applications have emerged in electronics
birth of a new field of research in mathematics in the mid-1970s, (Chua circuit and memristors), optimization for meta-heuristic
that of chaotic attractors. I had the privilege of inventing one algorithms (particle swarm optimization (PSO), differential
that, surprisingly, is still the subject of intensive research 50 years evolution (DE), Self-Organizing Migrating Algorithm (SOMA),...),
cryptography based chaos, generation of pseudo-random number,
Manuscript received: 28 September 2023, economy, etc.
Accepted: 28 September 2023.

1
[Link]@[Link] (Corresponding author)

CHAOS Theory and Applications 133

 Have these applications compromised the purity and beauty of
theoretical research? We attempt to describe the evolution of the
last 50 years on the subject from the perspective of this question.

Figure 2 Gumowski-Mira attractor for a = 0.93333, b = 0.92768.

Figure 1 Example of Julia set.

THE DAWN OF CHAOTIC DYNAMICAL SYSTEMS

The study of the frighteningly complicated solutions discovered
by Poincaré continued quietly for almost 80 years in several
directions including conservative and dissipative dynamical
systems, differential equations and difference equations. We can
cite among many, the pioneer works of Pierre Fatou (1878-1929)
and Gaston Julia (1893-1978) related to one-dimensional maps
with a complex variable (see Figure 1), near a century ago; those of
Cristian Mira and Igor Gumowski, who began their mathematical
research in 1958 (the Gumowski-Mira map (1), see Figure 2), the
fractals introduced in 1967 by Benoît Mandelbrot (1924-2010) Figure 3 Lorenz attractor for σ = 10, b = 8/3 and r = 27.
(Mandelbrot 1967), and of course the continuous attractors of
Lorenz (1963) (2) (Figure 3) and Rössler (1976) (Rössler 1976)
(Rössler 2020), (3) (Figure 4); and the discrete attractors of Hénon
(1976), Belykh (1976) (Belykh, V. N. et al. 2023) and Lozi (1977),
among many others.

2
 x
n+1 = f ( xn ) + byn with f ( xn ) = ax + 2(1 − a) 1+x x2 ,



y n +1 = f ( x n +1 ) − x n .

(1)

ẋ = σ(y − x ),






ẏ = rx − y − xz, (2)





ż = xy − bz.



ẋ1 = − x2 − x3 ,






ẋ2 = x1 + ax2 , (3) Figure 4 Rössler attractor for a = 0.2, b = 0.2 and c = 5.7.





ẋ3 = b + x3 ( x1 − c).


134 | René Lozi CHAOS Theory and Applications

 The images produced by these fractal sets 40 years ago,
astonished not only mathematicians accustomed to geometric
figures drawn only with rulers and compas, but also the general
public. Heinz-Otto Peitgen published a book containing dozens of
figures generated by complex dynamic systems, coining the name
"computer art" (Peitgen, H.-O. and Richter, P. H. 2011). Today,
no one is surprised by the use of chaotic systems in cinema or
advertising.

FIRST APPLICATIONS OF CHAOTIC DYNAMICAL SYS-

TEMS
Figure 6 (a) Chua circuit. (b) Chua attractor on oscilloscope.
Electric circuits
In Japan the Hayashi’s School (with disciples like Ikeda, Ueda
and Kawakami) in the same period, were motivated by simulation al. (Rodriguez-Vazquez, A. et al. 1987) in 1987 presented a special-
of chaotic dynamics by electric and electronic circuits. Chaotic purpose analog computer made of switched-capacitor circuit for
mappings were used as models of behavior of electric circuits (the analyzing chaos and bifurcation phenomena in nonlinear discrete
Ikeda map (4), see Figure 5). dynamical systems modeled by discrete maps. They published
 results for four maps: the logistic map, a piece-wise linear map, the

6 Hénon map and the Lozi map (6). For this last map, they built a
n+1 = 1 + u ( xn cos ( tn ) − yn sin ( tn ) with tn = 0.4 − 1+ x2 +y2 ,
 x

n n rather complicated circuit realization (see Figure 25 of (Rodriguez-
 Vazquez, A. et al. 1987)) and compared the attractor measured
n+1 = u ( xn sin ( tn ) + yn cos ( tn ).
 y

from this circuit with the corresponding numerical simulation and
(4)
found good agreement between them. Even if this example is
In 1983, Leon Chua invented a very simple electric circuit
not strictly speaking an application of the Lozi map for electric
producing chaos (5). The advantage of this circuit (see Figure 6 a))
purposes, it constitutes one of the first examples of solid realization.
was that the variables of the mathematical equations corresponded
However, these works cannot be considered as real applications.
to voltage and current and could be viewed on the screen of an
oscilloscope (see Figure 6 (b)).    
 x   1 − a | x | + y, 
 L a,b  =  (6)
y bx.
ẋ = α(y − Φ( x )),






ẏ2 = x − y + z, (5) Secure communications




 It was the discovery of the synchronization of chaotic electrical
ẋ3 = − βy.

circuits by Pecora and Carroll (Pecora, L. M. and Carroll, T. L.
with Φ( x ) = m1 x + 12 (m0 − m1 ) [| x + 1| − | x − 1|]. 1990) in 1990 that sparked research into secure communications.

A first reported experimental secure communication system

via chaotic synchronization using two Chua’s circuits (one as
master and one as slave) was built two years after. However, the
signal recovered from this system which used the Chua circuit,
contained some inevitable noise that degraded the fidelity of the
original message. The system was soon improved in 1993, by
cascading the output of the receiver in the original system, into an
identical copy of this receiver (Lozi, R. and Chua, L. O. 1993) (see
Figure 7). This cascading process was extended to multiple copies
and analyzed using filtering theory (Lozi, R. 1995) in the case of a
multi-tone signal.

In 2000, Dmitriev et al. (Dmitriev, A .S. et al. 2000) discussed a

principle of multiple access, in satellite communication systems
or cellular telephony based on fine structure of chaotic attractors,
using control of special chaotic trajectories. They demonstrated
the experimental verification of the proposed approach for
asynchronous packet data transmission. In their approach they
Figure 5 Ikeda attractor for u = 0.9.
considered that a chaotic attractor can be treated as a number
of countable sets of special trajectories: unstable periodic orbits
Before 1990 computers were not as efficient as they are today. (UPO) and transitions between these orbits. Instability of the
It is why many experimenters still used analog electrical systems periodic orbits and transient trajectories between them gives rise
to explore the behavior of chaotic maps. Rodriguez-Vasquez et to irregular chaotic behavior. They used the set of the unstable

CHAOS Theory and Applications 135

 
x n +1 = 1 − a | x n | + y n ,






yn+1 = bxn + kyn sin(zn ), (7)





z n +1 = y n + z n ,


where k is a real valued control parameter coupling gain between

the discrete-time memristor and the Lozi map. Since there are no
fixed points but hyperchaos can emerge, the memristor-based Lozi
map is a hidden hyperchaotic map.

Figure 7 Cascade of Chua circuits. For some specific control parameters, the 3-D memristor-based
Lozi map can show heterogeneous and homogeneous hidden
multistability. It should be noted that heterogeneous hidden
"skeleton" periodic trajectories, constituting the structure of the multistability implies the coexisting behavior of multiple hidden
strange attractor (or a part of this set), as a "reservoir" of potential attractors of different stability types, while homogeneous hidden
codes for multi-user communication systems. They observed multistability indicates the coexisting behavior of multiple hidden
that the multitude of the codes from a certain "reservoir" for attractors of the same stability type but only in different dynamic
communications is practically infinite, i.e., the number of users intervals. In addition to the coexistence of these heterogeneous
provided with individual code sets is unlimited. hidden attractors, the memristor-based Lozi map is very likely
to produce the coexistence of homogeneous hidden hyperchaotic
As an example of the realization of their method, they consid- attractors, i.e., homogeneous hidden multistability. Therefore,
ered twenty period-16 (UPO) of the Lozi map (6) for a = 1.7 and the homogeneous hidden hyperchaotic attractors from the 3-D
b = 0.5. They displayed the switching between them in the Figure memristor based Lozi map can be robustly controlled by the
2 of (Dmitriev, A .S. et al. 2000) and showed from this diagram that memristor’s initial conditions.
the forming of all successive cycles (10-times repeating) is practi-
cally instantaneous. Improving their initial method, they remarked Additionally, Wang et al. implemented this memristor in a
that unstable periodic orbits can be utilized for not only encoding digital circuit based on a high-performance micro-controller. They
the entire transmitted information, but also for attributing it to this physically obtained an image of the hyperchaotic hidden attractors
or that group of users, i.e., they play the role of "chaotic markers". using a digital oscilloscope. Eventually, a digital platform was
The idea to use the system of unstable periodic orbits as markers exploited, and its experimental phase portraits were obtained to
was applied to the problem of asynchronous packet transmission confirm the numerical portraits.
of data from several users through a single common communica-
tion channel. They concluded that the generating and controlling APPLICATIONS IN OTHER DOMAINS
of UPO may be realized in rather high frequency band, provided
in by modern digital methods. Optimization
Most engineering problems can be defined as optimization
problems, e.g. the finding of an optimal trajectory for a robot arm,
Memristors
the optimal thickness of steel in pressure vessels, the optimal set of
In 1971, L.O. Chua predicted the existence of a missing fourth parameters for controllers, optimal relations or fuzzy sets in fuzzy
passive circuit element, in addition to the three classical ones: models, etc. Solutions to such problems are usually difficult to
resistor, inductor and capacitor (Chua 1971). He called this new find their parameters which usually include variables of different
element "memristor" meaning it is a resistor with memory. It is types, such as floating point or integer variables.
characterized by a nonlinear constitutive relationship between
the charge q and the flux φ. Such a physical device would not be Applications of chaotic maps in the now flourishing field
reported until 2008, when a physical model of a two-terminal hp of optimization took longer to appear than applications in
device behaving like a memristor was announced (Strukov, D. B. electrical devices. The main reason comes from a paradigm
et al. 2008) sparkling intense research with thousands of papers shift in optimization algorithms: instead of using deterministic
published to date. A general Ohm’s law for theorizing this device algorithms like gradient method or the steepest descent which are
was published ten years ago (Abdelouahab, M.- S. et al. 2008). not efficient in high-dimensional problems optimization involving
hundred or thousand of variables, heuristic algorithms based
Nowadays, discrete memristor model is known as a research on an imitation of Darwin’s theory of the evolution of species,
hotspot. Many researchers have devoted themselves to the were introduced a few decades ago. Such algorithms require easy
analysis of chaotic phenomena in discrete memristors. Recently, access to random or chaotic numbers. This is why interest has
hidden attractors have also been discovered in some discrete only recently focused on chaotic attractors. It took three decades
memristors based maps (Zhang, L. P. et al. 2022). Wang et al. for this paradigm shift in the study of the chaotic maps (logistic,
(Wang, J. et al. 2022) included a discrete-time memristor to create a symmetric tent, Belykh, Hénon, Lozi, etc.). Instead of focusing on
memristive Lozi map. This new 3-D memristor-based Lozi map the theoretical study of their mathematical properties or on finding
was established by coupling a discrete memristor to the original generalizations, Araujo and Coelho (Araujo and Coelho 2008) used
2-D Lozi map (6). them as a core for particle swarm optimization (PSO) (see Figure 8).

136 | René Lozi CHAOS Theory and Applications

 Velocity for d‘ dimension of
i* particule after n iterations

Acceleration
Iteration number parameter
\ Dimension number

Next Position (after

n+1 iterations)

Particle number f
Velocity after De
n#i iterations \ Present Position f

Figure 8 Geometric core of Particle Swarm Optimization (PSO) algorithm.

Optimization algorithms based on the chaos theory are

methodologies for searching optimal solutions that differ from any In 2004, Zelinka in (Zelinka, I. 2004), introduced SOMA
of the existing traditional stochastic optimization techniques. Due (Self-Organizing Migrating Algorithm), a new class of stochastic
to the wandering of chaos, it can carry out overall searches in the optimization algorithms. Evolutionary algorithms work on
solution space at higher velocities when compared to stochastic populations of candidate solutions that are evolved in generations
ergodic searches, which has its computing based on probabilities. (two parents create one new individual – the offspring) in
This remark has been done in the pioneering work of Caponetto et which only the best-suited – or fittest – individuals are likely to
al. (Caponetto, R. et al. 2003), who, four years before Araujo and survive. Instead SOMA which can also works on a population of
Coelho found that chaotic sequences improved the performance of individuals, is based on the self-organizing behavior of groups
evolutionary algorithms. of individuals in a "social environment", e.g. a herd of animals
looking for food.
PSO method was used for many purpose like the control
of the thermal-vacuum system used at the Brazilian National A group of animals such as wolves or other predators may
Institute for Space Research (INPE). The original controller was be a good example. If they are looking for food, they usually
designed to control the temperature on the shroud (set of pipes) cooperate and compete so that if one member of the group is
of a chamber where satellites are tested (Marinke, R. et al. 2005). successful (it has found some food or shelter) then the other
This method was used by Pluhacek et al. (Pluhacek, M. et al. 2012) animals of the group change their trajectories towards the
who considered a Partial-Integral-Derivative (PID) controller for most successful member. If a member of this group is more
a Direct-Current (DC) motor system in order to obtain optimal successful than the previous best one (is has found more food,
settings. A DC motor is any of a class of rotary electrical motors etc.) then again all members change their trajectories towards the
that converts direct current electrical energy into mechanical new successful member. It is repeated until all members meet
energy. Proportional-Integral-Derivative (PID) control is the around one food source. This principle from the real world is of
most common control algorithm used in industry and has been course strongly simplified. Yet even so, it can be said it is that
universally accepted in industrial control. competitive-cooperative behavior of intelligent agents that allows
SOMA to carry out very successful searches.
The optimization process involving PSO algorithm was applied
to minimize errors of the output transfer function that can indicate Recently Zelinka et al. used SOMA (Zelinka, I. et al. 2023) for
the quality of regulation of such controller. the design of quantum computing circuits for the future quantum
computers.
Another evolutionary optimization algorithm called Differen-
tial Evolution (DE) was used by Davendra et al. (Davendra, D. Of course, we cannot present, within the limited extend of this
et al. 2010) in the same goal, and by Senkerik et al. (Senkerik, R. editorial, all the dozens of algorithms using chaotic attractors (see
et al. 2013) in the task of optimization of batch chemical reactor (Lozi, R. 2023) for a survey).
geometry.

CHAOS Theory and Applications 137

Cryptography on the balancing of agglomeration and dispersion forces. It is
Cryptography is the primary means of protecting communications defined by a two-dimensional piecewise smooth map depending
in the cyber world in which mankind lives today. Modern on four parameters. They discussed the emergence of the Wada
technologies involve fast communication links between potentially basins of coexisting attractors leading to the so-called final state
billions of devices via complex networks (satellite, mobile phone, sensitivity (see Figure 9). And also, in (Sushko, I. et al. 2023, in
Internet, etc.). The primary concern posed by these complex progress) in which Sushko et al. studied the dynamics of a financial
and tangled networks is their protection against passive and market model with trend-followers and contrarians proposed a
active attacks that could compromise public safety and privacy. 2D-piecewise linear discontinuous map F given by (8) (see Figure
Cryptography has been around for over two thousand years with 10).
the famous Caesar code used by Emperor Julius Caesar. Today, the
properties of chaotic attractors are recognized as being the basis of

n+1 = (1 − k 1 − b ) xn + k 1 xn−1 i f | xn − xn−1 | < k,
 x

part of the methods of cryptography.

xn+1 = (1 − k2 − b) xn + k2 xn−1 + m i f | xn − xn−1 | > k.

Among many algorithms based on chaotic dynamical systems,
we can mention the image encryption algorithms, like the optical (8)
color image encryption scheme based on fingerprint key and three-
step phase-shifting digital holography which was proposed by Su
et al. (Su, Y. et al. 2021). In this scheme the fingerprint is served as
secret key directly. The random phase masks generated from the
fingerprint using secure hash algorithm (SHA-256) and the chaotic
Lozi map are just used as interim variables. The fingerprint is
served as secret key directly. With the help of the fingerprint-based
random phase masks located in the linear canonical transform
domain and the three-step phase-shifting digital holography, the
primary color image that is hidden into a grey-scale carrier image
can be encrypted into three noise-like holograms. In addition, the
parameters of the chaotic Lozi map and linear canonical transform
can also provide additional security to the proposed encryption
scheme. Other examples of cryptography-based chaos can be
found in (El Assad, S. et al. 2022).

Economy
Since twenty years, one can find application of chaotic dynamical
systems in economy. For example Tang et al. (Tang, T. W. et al.
2004) carried out an analysis of Parrondo’s games with different Figure 9 2D piecewise smooth map G governing dynamics of a
chaotic switching strategies. The performance of Parrondo’s three region New Economic Geography model. Basins of attraction
games was compared with random and periodic switching of the fixed points (0, 0), (1, 0), (0, 1) (attracting in Milnor sense)
strategies. The main idea of Parrondo’s paradox, exposed in 1996, and of the three 2-piece chaotic attractors.
is that two individually losing games can be combined to win via
deterministic or non-deterministic mixing of games (Harmer, G.
P. et al. 2001). In (Tang, T. W. et al. 2004) a fair way to compare
random and chaotic Parrondo’s games was generalized. The
logistic, tent, sinusoidal and Gaussian 1-D maps were considered
together with Hénon and Lozi maps.

To play chaotic Parrondo’s games, one of these chaotic genera-

tor being chosen, we consider a sequence that it generates from an
initial value. Then every n-th iterate of such sequence determines
whether Game A or B is played. Of course the outcomes of
Parrondo’s game are affected by the different switching strategies
applied and the initial value chosen. The proportion of Game A
and B played is equal for all switching strategies for a fair compari-
son. In conclusion, the authors found that chaotic Parondo’s games
can give a higher rate of winning compared to random switching
strategies. This result recalls the remark made by Caponetto et al.
(Caponetto, R. et al. 2003) that chaotic sequences can improve the
performance of evolutionary algorithms versus random sequences.

Another examples can be found in (Commendatore, P. et al. Figure 10 Periodicity regions (where different colors are related to
2015) in which Commendatore et al. proposed a new economic attracting cycles of different periods) in the (b; k2)-parameter plane
geography model which describes spatial distribution of industrial for k1 = −1, m = 1.9, k = 0.1.
activity in the long run across three identical regions depending

138 | René Lozi CHAOS Theory and Applications

THEORETICAL RESULTS defines the diffusive coupling with the coupling coefficient γ3 . N
is the number of elements in the ensemble of coupled equations in
We have shown that chaotic attractors have been used for more
each ring. The coupling parameters σ1,2,3 characterize the coupling
than thirty years for applications in different fields. This does not
strength, and 2P, 2R, 2T are the number of neighbors on each ring
mean that they did not advance pure mathematics.
(P (resp. R, T) neighbors on the either side of the ith element). The
initial conditions are chosen to be randomly distributed in the
It is difficult to list all the improvements in chaotic dynamical
interval [−0.5, 0] for all the variables of the network (9).
systems theory and bifurcation theory, so many have been made
over the last half century. We can only name a few, such as the
Using numerical simulation they have demonstrated that the
concepts of Smale’Axiom A and horseshoe, homoclinic bifurcation
network of two symmetrically coupled ensembles of Hénon and
and Shilnikov attractors, border-collision bifurcation, ergodicity,
Lozi maps can show a novel type of chimera state, a solitary state
hyperbolicity, symbolic dynamics and kneading sequences,
chimera (SSC), when the coupling between them is weak. This
Sinai-Bowen-Ruelle measures, fractal dimensions, general usage
special structure emerges in the case if the Lozi ensemble exhibits
of fractional derivatives, fractional maps, topological entropy, etc.
a developed regime of solitary states. The SSC is fairly stable and
is observed within a finite range of parameter variation. If the two
I think the best example of a theory-practice-theory approach
layer network of nonlocally coupled Hénon and Lozi maps in the
is that of chimeras. Following the discovery of the synchronized
solitary state chimera is unidirectionally coupled to the third ring
chaotic attractors (theory), research focused on network of
of nonlocally coupled Hénon maps, then the effect of external
attractors with several topologies for multiple purposes like the
synchronization can be observed in a finite range of the coupling
creation of Pseudo Random Number Generation for cryptography
coefficient γ3 .
(Garasym, O. et al. 2017) (practice).

Describing the dynamical properties of synchronization of such

networks, special solutions called "chimeras" and "solitary states" CONCLUSION
were highlighted (theory).
The first research on chaotic dynamic systems marked the mind
of the public by the beauty of the images that these attractors
Rybalova et al. (Rybalova, E. et al. 2018) considered a complex
made it possible to draw. Nowadays applications of chaotic
system consisting of three coupled rings of nonlocally coupled
attractors in several domains (see (Lozi, R. 2023) for a survey)
chaotic maps. This multilayer network is described by the follow-
is a flourishing domain of research since three decades and can
ing equations:
nevertheless produce wonderful images (Figures 9, 10). In the
mean time, theoretical research is still very much alive and offers
 h i
j =i + P j j
 xni +1 = f ( xni , yin ) + 2P
σ1
∑ f ( xn , yn ) − f ( xni , yin ) + γ1 Fni ,

new mathematical tools such as chimeras, fractional differential


 j = i − P
equations and fractional mappings which in turn will allow the



i i
 yn+1 = bxn ,

development of new applications.




 h i

 ui i i j =i + R j j i i i
n+1 = f ( un , vn ) + 2R ∑ j=i − R f ( un , vn ) − f ( un , vn ) + γ2 Gn ,
 σ2
Chaotic attractors are definitely not a mathematical curiosity.

vin+1 = bxni ,


Acknowledgments




 h i
 i i , si ) + σ3 j =i + T j j i , si ) + γ H i , The author thanks Laura Gardini from University of Urbino (Italy)
z = f ( z ∑ f ( z , s ) − f ( z

n n n n n n 3 n

 n +1 2T j=i − T
and Iryna Sushko from National Academy of Sciences of Ukraine,




 i
sn+1 = bxni , Kyiv (Ukraine) for drawing two special figures for this editorial.


(9)
The first system of equations in (9) specifies a ring network of Availability of data and material
nonlocally coupled Hénon maps with f defined by (10) Not applicable.

f ( xn , yn ) = 1 − axn2 + yn , (10) Conflicts of interest

with a = 1.4, b = 0.3, σ1 = 0.72 and and P = 320. The second pair The author declares that there is no conflict of interest regarding
of equations corresponds to the ring of nonlocally coupled Lozi the publication of this paper.
maps with f defined by (11)
LITERATURE CITED
f ( xn , yn ) = 1 − a | xn | + yn , (11)
and is analyzed for a = 1.4, b = 0.3, σ2 = 0.206 and R = 180. Abdelouahab, M.- S., Lozi, R., and Chua, L. O., 2008 Memfractance:
The third pair of equations also determines the ring of nonlocally A mathematical paradigm for circuit elements with memory. Int.
coupled Hénon maps with a = 1.4, b = 0.3, σ1 = 0.295 and J. Bifurc. Chaos 24: 1430023.
T = 320. Araujo, E. and L. S. Coelho, 2008 Particle swarm approaches us-
ing lozi map chaotic sequences to fuzzy modelling of an exper-
The first two rings are coupled inertially via the coupling func- imental thermal-vacuum system. Applied Soft Computing 8:
tions Fni = − Gni = uin − xni with the coupling coefficients γ1 and 1354–1364.
γ2 . The third ring nodes is connected unidirectionally with the Belykh, V. N., Barabash, N. V., and Grechko, D. A. , 2023 Existence
first ring units by the coupling term γ3 Hni where proofs for strange attractors in piecewise-smooth nonlinear lozi-
hénon and belykh maps. Journal of Difference Equations and
Hni = f ( xni , yin ) − f (zin , sin ), (12) Applications pp. 1–21.

CHAOS Theory and Applications 139

Caponetto, R., Fortuna, L., Fazzino, S., and Xibilia, M. G., 2003 haced pso algorithm with discrete lozi map. Proceedings 26th
Chaotic sequences to improve the performance of evolutionary European Conference on Modelling and Simulation,ECMS 2012,
algorithms. IEEE Trans. Evol. Comput. 7: 289–304. Troitzsch, K. G.; Möhring, M.; Lotzmann, U. (Eds) pp. 405–409.
Chua, L. O., 1971 Particle swarm approaches using Lozi map Rodriguez-Vazquez, A., Huertas, J. L., Perez-Verdu, B., and Chua,
chaotic sequences to fuzzy modelling of an experimental L. O. , 1987 Chaos from switched-capacitor circuits: Discrete
thermal-vacuum system. IEEE Trans. Circuit Th. 18: 507–519. maps. Proceedings of the IEEE 75: 1090–1106.
Commendatore, P., Kubin, I., and Sushko, I., 2015 Typical bifurca- Rössler, O. E., 1976 Chaotic behavior in simple reaction system.
tion scenario in a three region symmetric new economic geog- Zeitschrift für Naturforschung A 31: 259–264.
raphy model. Mathematics and Computers in Simulation 108: Rössler, O. E., 2020 On the Rossler Attractor. Chaos Theory and
63–80. Applications 2: 1–2.
Davendra, D., Zelinka, I., and Senkerik, R., 2010 Chaos driven Rybalova, E., Semenova, N., and Anishchenko, V., 2018 Solitary
evolutionary algorithms for the task of pid control. Computers state chimera: Appearance, structure, and synchronization. Inter-
and Mathematics with Applications 60: 1088–1104. national Symposium on Nonlinear Theory and Its Applications
Dmitriev, A .S., Panas, A. I., and Starkov, S. O., 2000 Multiple NOLTA 2018, Tarragona, Spain pp. 601–604.
access communication based on control of special chaotic tra- Senkerik, R., Davendra, D, Zelinka, I., Pluhacek, M., and
jectories. Proceedings of 2nd International Conference. Control Kominkova Oplatkova, Z., 2013 Chaos driven differential evolu-
of Oscillations and Chaos(COC-2000), St. Petersburg, Russia 3: tion with lozi map in the task of chemical reactor optimization.
518–522. Lecture Notes in Computer Science 7895.
El Assad, S., Lozi, R., and Puech, W., 2022 Special Issue "Cryptogra- Strukov, D. B., Snider, G. S., Stewart, D. R., and Williams, R. S.,
phy and Its Applications in Information Security". Applied Science, 2008 The missing memristor found. Nature 453: 80–83.
MDPI,. Su, Y. , Xu, T. , Li, T. , Zhao, J. , and Liu, S. , 2021 Optical color image
Garasym, O., Lozi, J. P., and Lozi, R., 2017 How useful randomness encryption based on fingerprint key and phase-shifting digital
for cryptography can emerge from multicore-implemented com- holography. Optics and Lasers in Engineering 140: 106550.
plex networks of chaotic maps. Journal of difference equations Sushko, I. , Tramontana, F. , and Gardini, L. , 2023, in progress
and applications 23: 821–859. Optical color image encryption based on fingerprint key and
Harmer, G. P., Abbott, D., Taylor, P. G., and Parrondo J. M. R., 2001 phase-shifting digital holography. Working Papers Series in Eco-
Brownian ratchets and parrondo’s games. Chaos 11: 705A–714. nomics, Mathematics and Statistics, University of Urbino .
Heath, T. L., 1931 A Manual of Greek Mathematics. Oxford University Tang, T. W. , Allison, A., and Abbott, D. , 2004 Investigation of
Press, Oxford. chaotic switching strategies in parrondo’s games. Fluctuation
Høyrup J., 2011 Mesopotamian calculation: Background and and Noise Letters 4: L585–L596.
contrast to greek mathematics. Contribution to IX Congresso Wang, J., Gu, Y., Rong, K., and Xu, [Link] Zhang, X., 2022
della Società Italiana di Storia della Matematica, Genova, 17–19 Memristor-based lozi map with hidden hyperchaos. Mathemat-
novembre . ics 10: 3426.
Li, T. Y. and Yorke, J. A. , 1975 Period three implies chaos. The Zelinka, I., 2004 Self-organizing migrating algorithm. Studies in
American Mathematical Monthly 82: 985–992. Fuzziness and Soft Computing 141: 167–217.
Lorenz, E. N., 1963 Deterministic nonperiodic flow. Journal of the Zelinka, I., Kojecky, L., Lampart, M., Nowakova, M. J., and Plu-
Atmospheric Sciences 20: 130–141. car, J., 2023 isoma swarm intelligence algorithm in synthesis
Lozi, R., 1995 Secure communications via chaotic synchronization of quantum computing circuits. Applied Soft Computing 142:
in chua’s circuit and bonhoeffer-van der pol equation: numerical 110350.
analysis of the errors of the recovered signal. IEEE international Zhang, L. P., Wei, Z. C., Jiang, H. B., Lyu, W. P., and Bi, Q. S., 2022
Symposium on circuits and systems 1: 684–687. Extremely hidden multistability in a class of a two dimensional
Lozi, R., 2023 Algorithms using the chaotic lozi map for real ap- maps with a cosine memristor. Chin. Phys. B 31: 100503.
plications or for applications exploring some new mathematical
fields: a survey. Algorithms, To appear pp. 1319–1325.
How to cite this article: Lozi, R. Are Chaotic Attractors just a Math-
Lozi, R. and Chua, L. O., 1993 Secure communications via chaotic
ematical Curiosity or Do They Contribute to the Advancement of
synchronization ii: noise reduction by cascading two identical
Science? Chaos Theory and Applications, 5(3), 133-140, 2023.
receivers. International Journal of Bifurcation and Chaos 3: 1319–
1325. Licensing Policy: The published articles in Chaos Theory and
Mandelbrot, B., 1967 How long is the coast of britain? statistical Applications are licensed under a Creative Commons Attribution-
self-similarity and fractional dimension. Science, New Series 156: NonCommercial 4.0 International License.
1088–1104.
Marinke, R., Araujo, J. E., Coelho, L. S., and Matko, I., 2005 Par-
ticle swarm optimization (pso) applied to fuzzy modeling in a
thermal-vacuum system. Proceedings of the 5th International
Conference on Hybrid Intelligent Systems, Rio de Janeiro, Brazil
pp. 67–72.
Pecora, L. M. and Carroll, T. L., 1990 Synchronization in chaotic
systems. Phys. Rev. Lett. 64: 821.
Peitgen, H.-O. and Richter, P. H., 2011 The Beauty of Fractals: Images
of Complex Dynamical Systems. Springer Verlag, Berlin.
Pluhacek, M., Senkerik, R., Davendra, D., and Zelinka, I., 2012
Designing pid controller for dc motor system by means of en-

140 | René Lozi CHAOS Theory and Applications