Next Article in Journal
Remarks on the Maximum Entropy Principle with Application to the Maximum Entropy Theory of Ecology
Next Article in Special Issue
A New Chaotic System with a Self-Excited Attractor: Entropy Measurement, Signal Encryption, and Parameter Estimation
Previous Article in Journal
A Novel Method for Multi-Fault Feature Extraction of a Gearbox under Strong Background Noise
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Chaotic System with Multiple Attractors: Dynamic Analysis, Circuit Realization and S-Box Design

1
School of Electrical and Automation Engineering, East China Jiaotong University, Nanchang 330013, China
2
Department of Electrical and Electronics Engineering, Faculty of Technology, Sakarya University, Serdivan 54187, Turkey
3
School of Electronic and Information Engineering, Nanjing University of Information Science and Technology, Nanjing 210044, China
4
School of Electrical and Electronic Engineering, Hubei University of Technology, Wuhan 430068, China
5
Department of Computer Engineering, Faculty of Computer and Information Sciences, Sakarya University, Serdivan 54187, Turkey
*
Author to whom correspondence should be addressed.
Entropy 2018, 20(1), 12; https://doi.org/10.3390/e20010012
Submission received: 17 November 2017 / Revised: 22 December 2017 / Accepted: 25 December 2017 / Published: 27 December 2017

Abstract

:
This paper reports about a novel three-dimensional chaotic system with three nonlinearities. The system has one stable equilibrium, two stable equilibria and one saddle node, two saddle foci and one saddle node for different parameters. One salient feature of this novel system is its multiple attractors caused by different initial values. With the change of parameters, the system experiences mono-stability, bi-stability, mono-periodicity, bi-periodicity, one strange attractor, and two coexisting strange attractors. The complex dynamic behaviors of the system are revealed by analyzing the corresponding equilibria and using the numerical simulation method. In addition, an electronic circuit is given for implementing the chaotic attractors of the system. Using the new chaotic system, an S-Box is developed for cryptographic operations. Moreover, we test the performance of this produced S-Box and compare it to the existing S-Box studies.

1. Introduction

The discovery of the well-known Lorenz attractor [1] in 1963 opened the upsurge of chaos research. In the decades thereafter, a large number of meaningful achievements on chaos control, chaotification, synchronization and chaos application have emerged continuously. Great changes have also been made to the understanding of chaos. Scholars began to think more about a way to produce chaos rather than blindly suppress chaos. The generation of chaotic attractors in three-dimensional autonomous ordinary differential systems has been of particular interest. As we all know, a multitude of typical systems with chaotic attractors were found, including Rössler system, Chen system, Sprott system, Lü system, etc. [2,3,4,5,6,7,8].
With the further research of chaos, scientists found that some nonlinear dynamic systems not only have a chaotic attractor but also coexist with multiple attractors for a set of fixed parameter values. The coexisting attractors may be fixed points, limit cycles, strange attractors, etc. The number and type of attractors are usually associated with parameters and initial conditions of the system. Each attractor has its own basin of attraction which is composed of the initial conditions leading to long-term behavior that settles onto the attractor. The phenomenon of multiple attractors can be seen in many biological systems and physical systems [9,10,11]. In recent years, the low-dimensional autonomous chaotic systems with multiple attractors have aroused scholars’ research enthusiasm. Li and Sprott found multiple attractors in chaotic systems by numerical analysis and introduced the offset boosting method and conditional symmetry method for producing multiple attractors in differential systems [12,13,14,15,16]. Kengne et al. analyzed the multiple attractors of simple chaotic circuits, which can be described by differential equations [17,18]. Bao and Xu put forward some memristor-based circuit systems with multiple chaotic attractors [19,20]. Lai et al. proposed some three-dimensional and four-dimensional continuous chaotic systems with multiple attractors [21,22,23]. Wei et al. attempted to reveal the intrinsic mechanism of the multiple attractors by analyzing the bifurcation of the system [24]. The investigation of chaos and multiple coexisting attractors is indeed a very interesting research issue in academia. It helps to recognize the dynamic evolution of the actual system and promote the study of complexity science.
Chaotic systems have been found to be used in many areas. The most valuable application is cryptology. Chaotic system, in view of its rich dynamic behaviors and initial sensitivity, provides the mixing and spreading properties, which are the general requirements of encryption [25,26]. The S-Box is known as the most basic unit with scrambling function in block encryption algorithms. A good S-Box can make the encryption algorithm have higher security and better ability to withstand attacks. Although there have been many works on chaotic S-Box design, it is still important to generate S-Box according to some unique chaotic systems. Before applying the chaotic system to engineering fields, it is necessary to realize it through electronic circuits in order to prove its real existence. Based on circuit theory and simple circuit elements, chaotic signals can be generated in oscilloscopes. So far, the electronic circuit has become an important tool for the analysis of chaotic systems [27,28,29,30].
This present paper considers a special polynomial chaotic system with the following features: (i) it has three nonlinearities x z , y z , x y z and the invariance of transformation ( x , y , z ) ( x , y , z ) ; (ii) it performs a butterfly attractor; and (iii) it has a stable equilibrium, an unstable equilibrium and two stable equilibria, three unstable equilibria for different parameter conditions, and experiences mono-stability, bi-stability, mono-periodicity, bi-periodicity, one strange attractor and two coexisting strange attractors. After investigating the dynamic behavior of the system, an electronic circuit and an S-Box are designed according to the system.
The paper is arranged as follows: Section 2 describes the chaotic system and shows its butterfly attractor. Section 3 analyzes the stability of the equilibria. Section 4 studies the dynamic behavior of the system. Section 5 considers the electronic circuit realization of the system. Section 6 establishes the S-Box according to the system, and Section 7 summarizes the conclusions of this paper.

2. The Description of a Chaotic System

The chaotic system proposed in this paper can be expressed as the following set of differential equations:
x ˙ = a x y z , y ˙ = b y + x z , z ˙ = c z + x y z + k ,
with state vector ( x , y , z ) R 3 and parameter vector ( a , b , c , k ) R 4 . A butterfly attractor can be observed by numerical simulation on Matlab software (Matlab 8.0, MathWorks, Natick, MA, USA). The phase portraits of system (1) under parameters ( a , b , c , k ) = ( 4 , 9 , 4 , 4 ) and initial condition ( 1 , 1 , 1 ) are shown in Figure 1. It visually demonstrates that system (1) displays an attractor as the system trajectories will eventually move to a bounded region. The Lyapunov exponents of the system are calculated as l 1 = 1.7729 , l 2 = 0.0000 , l 3 = 7.5949 . The Lyapunov dimension is D l = 2 l 1 / l 3 = 2.2334 , so it can be determined that the attractor is a chaotic attractor. The time series of z generated from two very close initial conditions ( 1 , 1 , 1 ) and ( 1 , 1 , 1.001 ) are plotted in Figure 2. At the beginning, they are almost the same, but their differences are increasing after a number of iterations. That is to say, system (1) is sensitive dependence on initial conditions and its future behavior is unpredictable in the long term. The Poincaré map of system (1) is obtained via selecting the sections Δ 1 = { ( x , y ) R 2 z = 10 } and Δ 2 = { ( y , z ) R 2 x = 0 } . As shown in Figure 3, the Poincaré map is a sheet of point set. It is consistent with the nature of chaos.

3. The Stability of Equilibria

Suppose that parameters a , b , c , k are all positive real numbers. The equilibria of system (1) can be obtained by solving x ˙ = y ˙ = z ˙ = 0 . If k c a b , system (1) has only one equilibrium O ( 0 , 0 , k / c ) . If k < c a b , system (1) has three equilibria as follows:
O ( 0 , 0 , k / c ) , O 1 ( ( c a b k ) / a , ( c a b k ) / b , a b ) , O 2 ( ( c a b k ) / a , ( c a b k ) / b , a b ) .
Proposition 1.
Suppose that b > a > 0 , k > 0 , and the parameter c satisfies the following condition:
k a b < c < 2 k [ ( a 2 + b 2 ) a b + k ( b a ) ] a b [ ( a + b ) 2 a b + k ( b a ) ] ,
then the equilibria O 1 and O 2 of system (1) are asymptotically stable.
Proof. 
By linearizing the system (1) at the equilibrium, the Jacobian matrix is given by
H = a z y z b x y z x z x y c .
By using λ I H = 0 , the corresponding characteristic equation evaluated at O 1 , O 2 is obtained as
λ 3 + w 1 λ 2 + w 2 λ + w 3 = 0 ,
where
w 1 = ( b a + k a b ) , w 2 = ( a b ) ( c 2 k a b ) , w 3 = 4 a b ( c k a b ) .
 ☐
According to the Routh–Hurwitz criterion, the equilibria O 1 , O 2 are stable if all the roots of Equation (4) have negative real parts. This requires that w 1 > 0 , w 2 > 0 , w 3 > 0 and w 1 w 2 > w 3 . It is easy to verify that w 1 > 0 , w 2 > 0 , w 3 > 0 if b > a > 0 , k > 0 and
k a b < c < 2 k a b .
To make w 1 w 2 > w 3 , the parameter c should meet
c < c 0 = 2 k [ ( a 2 + b 2 ) a b + k ( b a ) ] a b [ ( a + b ) 2 a b + k ( b a ) ] .
Since c 0 < 2 k a b , then O 1 , O 2 are asymptotically stable if b > a > 0 , k > 0 , k a b < c < c 0 . When the parameter c passes through the critical value c 0 , then double Hopf bifurcation occur with two limit cycles branched from O 1 , O 2 and system (1) loses its stability.
Proposition 2.
Suppose that b > a > 0 , c > 0 , k > 0 , then: (i) the equilibrium O is unstable for c > k a b ; and (ii) the equilibrium O is asymptotically stable for c k a b .
Proof. 
The characteristic equation evaluated at O is given by
( λ + c ) [ c 2 λ 2 + ( b a ) c 2 λ + k 2 a b c 2 ] = 0 .
If c > k a b , then Equation (7) has a root with a positive real part. Thus, O is unstable. If c < k a b , all the roots of Equation (7) have negative real parts, which implies that O is stable. When c = k a b , Equation (7) has three roots λ 1 = 0 , λ 2 = a b , λ 3 = c . Therefore, O is non-hyperbolic equilibrium. It can be verified that O is asymptotically stable by applying the center manifold theorem. ☐

4. The Evolution of Multiple Attractors

Detailed investigation of the complex dynamic behaviors of system (1) is presented in this section. Simulation experiments including bifurcation diagrams, phase portraits, Lyapunov exponents, and Poincaré maps give a close and intuitive look at system (1). There is a wealth of chaotic dynamics associated with the fractal properties of the attractor in system (1). With the change of parameters, system (1) experiences stable state, periodic state and chaotic state. For different initial values, system (1) performs different types of attractors with independent domains of attraction.

4.1. Dynamic Evolution with Parameter c

Consider the dynamic evolution of system (1) with respect to parameter c under the given parameter conditions a = 2 , b = 8 , k = 4 . The bifurcation diagrams of system (1) versus c ∈ (0, 6) are shown in Figure 4a, where the red color branch and blue color branch are yielded from initial values x 01 = ( 1 , 1 , 1 ) , x 02 = ( 1 , 1 , 1 ) , respectively. The overlapped regions of the red color and blue color branches indicate that the trajectories of x 01 , x 02 eventually tend to the same attractor, while the separated regions indicate that the trajectories of x 01 , x 02 tend to different attractors. Figure 4b is the Lyapunov exponents of system (1) with initial value x 01 . It shows that the system (1) experiences stable state, periodic state, chaotic state with the variation of c. When c ( 0 , 1 ) , system (1) is mono-stable as it has only one stable equilibrium. When c ( 1 , 1.396 ) , system (1) performs bi-stability with respect to the existence of two stable equilibria. As c increases across the critical value c 0 = 1.396, system (1) occurs double Hopf bifurcation at the equilibria. When c ( 1.396 , 1.516 ) , system (1) performs bi-periodicity. When c ( 1.516 , 2.257 ) , system (1) changes into mono-periodic state. When c ( 2.821 , 3.096 ) , system (1) yields two strange attractors from initial values x 01 , x 02 . When c ( 3.310 , 4.167 ) ( 4.370 , 5.324 ) ( 5.480 , 6 ) , system (1) has only one chaotic attractor. Table 1 describes the attractors of system (1) with different values of c. The phase portraits in Figure 5 illustrate the existence of different types of attractors in system (1).

4.2. Dynamic Evolution with Parameter k

The bifurcation diagrams of system (1) for parameters ( a , b , c ) = ( 4 , 9 , 4 ) , k ( 5 , 25 ) are shown in Figure 6a, where the red color branch and blue color branch are yielded from initial values x 01 , x 02 , respectively. Obviously, the state of system (1) changes from chaos to period and then to stable when parameter k increases from 5 to 25. It also can be illustrated by the Lyapunov exponents in Figure 6b. The maximum Lyapunov exponent is positive with c ( 5 , 13.6 ) ( 13.9 , 14.8 ) ( 15.4 , 15.9 ) , negative with c ( 19.8 , 25 ) , and equal to zero with c ( 13.7 , 13.8 ) ( 14.9 , 15.3 ) ( 16 , 19.7 ) . For c = 5 , 15 , 18 , 25 , we can observe a strange attractor, a limit cycle, and a stable point of system (1), with their phase portraits are shown in Figure 7. For c = 19 , 20 , we can observe two coexisting periodic attractors and two coexisting point attractors of system (1), as shown in Figure 8.

5. Electronic Circuit Realization

There are many works that are related to chaos based applications in the literature [31,32,33,34,35,36]. Here, we will present the circuit realization of system (1) for realistically obtaining its chaotic attractors. The numerical simulation in Figure 5e displays two coexisting strange attractors in system (1) for ( a , b , c , k ) = ( 2 , 8 , 2.9 , 4 ) and initial conditions ( ± 1 , ± 1 , 1 ) . For circuit realization of this state of system (1), we need to refrain from saturation of circuit elements, and the effective way to achieve this goal is to reduce the voltage values of the circuit via scaling the variables of system (1). In the process of scaling, we assume ( X , Y , Z ) = ( x , y , z / 2 ) and then the scaled system is obtained as
X ˙ = a X 2 Y Z , Y ˙ = b Y + 2 X Z , Z ˙ = c Z + X Y Z + k 2 .
Figure 9 gives the new phase portraits of the scaled system (8) for ( a , b , c , k ) = ( 2 , 8 , 2.9 , 4 ) . Evidently, the scaling process does not cause fundamental changes to the system (1), but just limits the variables to a smaller region Ω = { ( x , y , z ) x , y ( 5 , 5 ) , z ( 0 , 10 ) } .
The circuit diagram of system (8) raised by the OrCAD-PSpice programme (OrCAD 16.6, OrCAD~company, Hillsboro, OR, USA) is presented in Figure 10. It has three input (or output) signals with respect to the variables X , Y , Z , and the operations between signals realized via the basic electronic materials including resistors, capacitor, TL081 operational amplifiers (op-amps), and AD633 multipliers. By fixing R 1 = R 3 = 20 K Ω , R 2 = 200 K Ω , R 4 = 50 K Ω , R 5 = R 6 = 100 K Ω , R 7 = 138 K Ω , R 8 = 3000 K Ω , R 9 = 4 K Ω , C 1 = C 2 = C 3 = 1 nF, V n = 15 V, V p = 15 V and executing the circuit on electronic card shown in Figure 11, we can obtain the outputs of circuit in the oscilloscope. The oscilloscope graphics in Figure 12 show good consistency with the numerical simulations in Figure 9. Hence, we can come to a conclusion that the coexisting chaotic attractors in system (1) are physically obtained.

6. S-Box Design and Its Performance Analysis

This section aims to raise a new chaotic S-Box algorithm by applying system (1). In the algorithm design, first random number generation is performed and then S-Box is produced. The S-Box generation algorithm pseudo code is shown in Algorithm 1. For establishing the S-Box production algorithm, we first input the parameters ( a , b , c , k ) = ( 2 , 8 , 2.9 , 4 ) and initial value ( x 0 , y 0 , z 0 ) = ( 1 , 1 , 1 ) of the system and then the float number outputs are produced. In order to generate more random outputs in the analysis of the chaotic system, we select an appropriate step interval Δ h and used it as a sample value. More random sequences are obtained by setting the appropriate step interval Δ h = 0.000001 . System (1) is solved by using the RK4 algorithm with the initial conditions and the specified sampling value, and time series are obtained. In our designed chaotic S-Box algorithm, the outputs of y, z phases of system (1) are used. Float number values (32 bits) obtained from these phases are converted to a binary system. By taking 8 bits from the low significance parts (LSB) of the 32-bit number sequences generated from both phases, these values are XORed. The obtained new 8-bit value is converted to a decimal number. This value is discarded if the decimal number was previously generated and included in the S-Box, if not produced before, it is added to the S-Box. In this way, this process continues until the distinct 256 values (between 0 and 255) are obtained on the S-Box. The generated S-Box is shown in Table 2.
Algorithm 1 The S-Box generation algorithm pseudo code.
 1:
Start;
 2:
Inputting parameters and initial value of the system;
 3:
Sampling with step interval Δ h ;
 4:
i = 1, S-Box = [];
 5:
while ( i < 257 ) do
 6:
    Solving system with RK4 algorithm and obtaining time series ( y , z ) ;
 7:
    Convert float to binary number;
 8:
    Take LSB-8 bit value from RNG y z phase;
 9:
    Convert binary to decimal number (8 bit)
10:
    if (Is there decimal value in S-Box = yes) then
11:
        Go step 6.
12:
    else(Is there decimal value in S-Box = no)
13:
        Sbox[i] ← decimal value;
14:
        i++;
15:
    end
16:
end
17:
S-Box ← reshape(Sbox,16,16);
18:
Ready to use 16 × 16 chaos-based S-Box;
19:
End.
In order to determine that the produced S-Boxes are robust and strong against attack, some performance tests are applied. We mainly focus on these tests: nonlinearity, outputs’ bit independence criterion (BIC), strict avalanche criterion (SAC), and differential approach probability (DP). In addition, the comparisons of the performance between this new S-Box and the existing chaotic S-Box proposed by Chen [37], Khan [38], Wang [39], Ozkaynak [40], Jakimoski [41], Hussain [42], Tang [43] are presented in Table 3.
Nonlinearity is regarded to be the most core part of all the performance tests. The nonlinearity values of the S-Box yielded by system (1) are obtained as 104, 106, 104, 104, 108, 104, 110 and 104. Accordingly, its average value, minimum value and maximum value are computed as 105, 104 and 110. By comparing the nonlinearity of other S-Box shown in Table 3, we can claim that the new S-Box is better than others in some measure.
SAC is put forward by Webster et al. [44]. Generally speaking, the establishment of SAC implies a possibility that half of each output bit will be changed with the change of a single bit. Table 3 tells the average, minimum and maximum SAC values of the new S-Box as 0.5014 , 0.3906 , 0.5937 . Evidently, the average value of the new S-Box is close to the ideal value 0.5. BIC is also an important criterion found by Webster et al. [44]. It can partially measure the security of cryptosystems. The set of vectors generated by reversing one bit of the open text is tested to be independent of all the pairs of avalanche variables. While the relation between avalanches is measured, variable pairs are necessary to calculate the correlation value [45]. BIC-SAC and BIC-Nonlinearity values are calculated when the BIC value is calculated. When the values in Table 3 are examined, the BIC-SAC values are calculated as follows: average value 0.5028, minimum value 0.4394 and maximum value 0.5312. The average value is almost equal to the optimum value 0.5.
DP is another performance index for testing the S-Box, which is established by Biham et al. [46]. In this analysis, the XOR distribution balance between the input and output bits of the S-Box is determined. The very close probability of XOR distribution between input and output bits often indicates the ability to resist the differential attack of the S-Box. The low DP value suggests that the S-Box is more resistant to attack. The minimum and maximum DP values of the new S-Box are determined as 4.0 and 10. From Table 3, we know that the DP value of the new S-Box is the same as the S-Boxes presented by Tang and Ozkaynak.
After testing the performance of the new S-Box by using some important indices and comparing with other S-Boxes, we can determine that the new S-Box generated by system (1) has better performance than other S-Boxes. Thus, it will be more suitable for attack resistant and strong encryption.

7. Conclusions

A special chaotic system with multiple attractors was studied in this letter. The complex dynamic behaviors of the system were mainly presented by numerical simulations. Bifurcation diagrams and phase portraits indicated that the system exhibits a pair of point attractors, a pair of periodic attractors, and a pair of strange attractors with the variation of system parameters. In addition, an electronic circuit was designed for realizing the chaotic attractors of the system. Moreover, a new S-Box was generated by applying the chaotic system, and the performance evaluation and comparison of the S-Box were presented. It showed that the new S-Box has better performance than some existing S-Boxes. Actually, the study of chaotic system with multiple attractors is of recent interest. More important issues corresponding to this topic will be addressed in our future paper.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (No. 61603137, 61603127),the Jiangxi Natural Science Foundation of China (No. 20171BAB212016) and Sakarya University Scientific Research Projects Unit (No. 2016-09-00-008, 2016-50-01-026).

Author Contributions

Qiang Lai designed the study and wrote the paper. Akif Akgul and Ünal Çavuşoğlu contributed to the experiment and algorithm design. Chunbiao Li and Guanghui Xu partially undertook the theoretical analysis and simulation work of the paper. All authors read and approved the manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Lorenz, E.N. Deterministic non-periodic flow. J. Atmos. Sci. 1963, 20, 130–141. [Google Scholar] [CrossRef]
  2. Rössler, O.E. An equation for continuous chaos. Phys. Lett. A 1976, 57, 397–398. [Google Scholar] [CrossRef]
  3. Chen, G.; Ueta, T. Yet another chaotic attractor. Int. J. Bifurc. Chaos 1999, 9, 1465–1466. [Google Scholar] [CrossRef]
  4. Lü, J.; Chen, G. A new chaotic attractor coined. Int. J. Bifurc. Chaos 2000, 3, 659–661. [Google Scholar] [CrossRef]
  5. Guan, Z.H.; Lai, Q.; Chi, M.; Cheng, X.M.; Liu, F. Analysis of a new three-dimensional system with multiple chaotic attractors. Nonlinear Dyn. 2014, 75, 331–343. [Google Scholar] [CrossRef]
  6. Jafari, S.; Sprott, J.C.; Molaie, M. A simple chaotic flow with a plane of equilibria. Int. J. Bifurc. Chaos 2016, 26, 1650098. [Google Scholar]
  7. Lai, Q.; Guan, Z.H.; Wu, Y.; Liu, F.; Zhang, D. Generation of multi-wing chaotic attractors from a Lorenz-like system. Int. J. Bifurc. Chaos 2013, 23, 1350152. [Google Scholar]
  8. Wang, X.; Chen, G. Constructing a chaotic system with any number of equilibria. Nonlinear Dyn. 2013, 71, 429–436. [Google Scholar] [CrossRef]
  9. Riecke, H.; Roxin, A.; Madruga, S.; Solla, S.A. Multiple attractors, long chaotic transients, and failure in small-world networks of excitable neurons. Chaos 2007, 17, 026110. [Google Scholar] [CrossRef] [PubMed]
  10. Schwartz, J.L.; Grimault, N.; Hupe, J.M.; Moore, B.C.; Pressnitzer, D. Multistability in perception: Binding sensory modalities, an overview. Philos. Trans. R. Soc. B 2012, 367, 896–905. [Google Scholar] [CrossRef] [PubMed]
  11. Yuan, G.; Wang, Z. Nonlinear mechanisms for multistability in microring lasers. Phys. Rev. A 2015, 92, 043833. [Google Scholar]
  12. Li, C.B.; Sprott, J.C. Variable-boostable chaotic flows. Optik 2016, 127, 10389–10398. [Google Scholar] [CrossRef]
  13. Li, C.B.; Sprott, J.C. Multistability in the Lorenz system: A broken butterfly. Int. J. Bifurc. Chaos 2014, 24, 1450131. [Google Scholar] [CrossRef]
  14. Li, C.B.; Sprott, J.C.; Hu, W.; Xu, Y. Infinite multistability in a self-reproducing chaotic system. Int. J. Bifurc. Chaos 2017, 27, 1750160. [Google Scholar]
  15. Li, C.B.; Sprott, J.C.; Xing, H. Hypogenetic chaotic jerk flows. Phys. Lett. A 2016, 380, 1172–1177. [Google Scholar] [CrossRef]
  16. Li, C.B.; Sprott, J.C.; Xing, H. Constructing chaotic systems with conditional symmetry. Nonlinear Dyn. 2017, 87, 1351–1358. [Google Scholar] [CrossRef]
  17. Kengne, J.; Tabekoueng, Z.N.; Tamba, V.K.; Negou, A.N. Periodicity, chaos, and multiple attractors in a memristor-based Shinriki’s circuit. Chaos 2015, 25, 103126. [Google Scholar] [CrossRef] [PubMed]
  18. Kengne, J.; Tabekoueng, Z.N.; Fotsin, H.B. Dynamical analysis of a simple autonomous jerk system with multiple attractors. Nonlinear Dyn. 2016, 83, 751–765. [Google Scholar] [CrossRef]
  19. Bao, B.C.; Jiang, T.; Xu, Q.; Chen, M.; Wu, H.; Hu, H.Y. Coexisting infinitely many attractors in active band-pass filter-based memristive circuit. Nonlinear Dyn. 2016, 86, 1711–1723. [Google Scholar] [CrossRef]
  20. Xu, Q.; Lin, Y.; Bao, B.C.; Chen, M. Multiple attractors in a non-ideal active voltage-controlled memristor based Chua’s circuit. Chaos Solitons Fractals 2016, 83, 186–200. [Google Scholar] [CrossRef]
  21. Lai, Q.; Chen, S. Research on a new 3D autonomous chaotic system with coexisting attractors. Optik 2016, 127, 3000–3004. [Google Scholar] [CrossRef]
  22. Lai, Q.; Chen, S. Coexisting attractors gnerated from a new 4D smooth chaotic system. Int. J. Control Autom. Syst. 2016, 14, 1124–1131. [Google Scholar]
  23. Lai, Q.; Chen, S. Generating multiple chaotic atractors from Sprott B system. Int. J. Bifurc. Chaos 2016, 26, 1650177. [Google Scholar] [CrossRef]
  24. Wei, Z.C.; Yu, P.; Zhang, W.; Yao, M. Study of hidden attractors, multiple limit cycles from Hopf bifurcation and boundedness of motion in the generalized hyperchaotic Rabinovich system. Nonlinear Dyn. 2016, 82, 131–141. [Google Scholar] [CrossRef]
  25. Amigo, J.M.; Kocarev, L.; Szczepanski, J. Theory and practice of chaotic cryptography. Phys. Lett. A 2007, 366, 211–216. [Google Scholar] [CrossRef]
  26. Alvarez, G.; Li, S. Some basic cryptographic requirements for chaos-based cryptosystems. Int. J. Bifurc. Chaos 2006, 16, 2129–2151. [Google Scholar] [CrossRef]
  27. Wang, X.; Pham, V.T.; Jafari, S.; Volos, C.; Munoz-Pacheco, J.M.; Tlelo-Cuautle, E. A new chaotic system with stable equilibrium: From theoretical model to circuit implementation. IEEE Access 2017, 5, 8851–8858. [Google Scholar] [CrossRef]
  28. Tlelo-Cuautle, E.; Rangel-Magdaleno, J.J.; Pano-Azucena, A.D.; Obeso-Rodelo, P.J.; Nunez-Perez, J.C. FPGA realization of multi-scroll chaotic oscillators. Commun. Nonlinear Sci. Numer. Simul. 2015, 27, 66–80. [Google Scholar] [CrossRef]
  29. Tlelo-Cuautle, E.; Pano-Azucena, A.D.; Rangel-Magdaleno, J.J.; Carbajal-Gomez, V.H.; Rodriguez-Gomez, G. Generating a 50-scroll chaotic attractor at 66 MHz by using FPGAs. Nonlinear Dyn. 2016, 85, 2143–2157. [Google Scholar] [CrossRef]
  30. Trejo-Guerra, R.; Tlelo-Cuautle, E.; Carbajal-Gomez, V.H.; Rodriguez-Gomez, G. A survey on the integrated design of chaotic oscillators. Appl. Math. Comput. 2013, 219, 5113–5122. [Google Scholar] [CrossRef]
  31. Akgul, A.; Moroz, I.; Pehlivan, I.; Vaidyanathan, S. A new four-scroll chaotic attractor and its engineering applications. Optik 2016, 127, 5491–5499. [Google Scholar] [CrossRef]
  32. Cavusoglu, U.; Akgul, A.; Kacar, S.; Pehlivan, I.; Zengin, A. A novel chaos based encryption algorithm over TCP data packet for secure communication. Secur. Commun. Netw. 2016, 9, 1285–1296. [Google Scholar] [CrossRef]
  33. Akgul, A.; Hussain, S.; Pehlivan, I. A new three-dimensional chaotic system, its dynamical analysis and electronic circuit applications. Optik 2016, 127, 7062–7071. [Google Scholar] [CrossRef]
  34. Akgul, A.; Calgan, H.; Koyuncu, I.; Pehlivan, I.; Istanbullu, A. Chaos-based engineering applications with a 3D chaotic system without equilibrium points. Nonlinear Dyn. 2016, 84, 481–495. [Google Scholar] [CrossRef]
  35. Trejo-Guerra, R.; Tlelo-Cuautle, E.; Jimenez-Fuentes, J.M.; Sanchez-Lopez, C.; Munoz-Pacheco, J.M.; Espinosa-Flores-Verdad, G.; Rocha-Pereza, J.M. Integrated circuit generating 3- and 5-scroll attractors. Commun. Nonlinear Sci. Numer. Simul. 2012, 17, 4328–4335. [Google Scholar] [CrossRef]
  36. Tlelo-Cuautle, E.; Fraga, L.G.; Pham, V.T.; Volos, C.; Jafari, S.; Quintas-Valles, A.J. Dynamics, FPGA realization and application of a chaotic system with an infinite number of equilibrium points. Nonlinear Dyn. 2017, 89, 1129–1139. [Google Scholar] [CrossRef]
  37. Chen, G.; Chen, Y.; Liao, X. An extended method for obtaining S-boxes based on three-dimensional chaotic Baker maps. Chaos Solitons Fractals 2007, 31, 571–579. [Google Scholar] [CrossRef]
  38. Khan, M.; Shah, T.; Mahmood, H.; Gondal, M.A.; Hussain, I. A novel technique for the construction of strong S-boxes based on chaotic Lorenz systems. Nonlinear Dyn. 2012, 70, 2303–2311. [Google Scholar] [CrossRef]
  39. Wang, Y.; Wong, K.W.; Liao, X.; Xiang, T. A block cipher with dynamic S-boxes based on tent map. Commun. Nonlinear Sci. Numer. Simul. 2009, 14, 3089–3099. [Google Scholar] [CrossRef]
  40. Ozkaynak, F.; Ozer, A.B. A method for designing strong S-Boxes based on chaotic Lorenz system. Phys. Lett. A 2010, 374, 3733–3738. [Google Scholar]
  41. Jakimoski, G.; Kocarev, L. Chaos and cryptography: Block encryption ciphers based on chaotic maps. IEEE Trans. Circuits Syst. I Fundam. Theory Appl. 2001, 48, 163–169. [Google Scholar] [CrossRef]
  42. Hussain, I.; Shah, T.; Gondal, M.A. A novel approach for designing substitution-boxes based on nonlinear chaotic algorithm. Nonlinear Dyn. 2012, 70, 1791–1794. [Google Scholar] [CrossRef]
  43. Tang, G.; Liao, X. A method for designing dynamical S-boxes based on discretized chaotic map. Chaos Solitons Fractals 2005, 23, 1901–1909. [Google Scholar]
  44. Webster, A.F.; Tavares, S.E. On the design of S-Boxes. In Advances in Cryptology-CRYPTO’85 Proceedings; Williams, H.C., Ed.; Springer: Berlin, Heidelberg, 1986; Volume 218, pp. 523–534. [Google Scholar]
  45. Hussain, I.; Shah, T.; Mahmood, H.; Gondal, M.A. Construction of S8 Liu J S-boxes and their applications. Comput. Math. Appl. 2012, 64, 2450–2458. [Google Scholar] [CrossRef]
  46. Biham, E.; Shamir, A. Differential cryptanalysis of DES-like cryptosystems. J. Cryptol. 1991, 4, 3–72. [Google Scholar] [CrossRef]
Figure 1. The butterfly attractor of system (1): (a) x y z ; (b) x y ; (c) x z ; (d) y z .
Figure 1. The butterfly attractor of system (1): (a) x y z ; (b) x y ; (c) x z ; (d) y z .
Entropy 20 00012 g001
Figure 2. The time series of variable z generated from initial conditions ( 1 , 1 , 1 ) (red color) and ( 1 , 1 , 1.001 ) (blue color).
Figure 2. The time series of variable z generated from initial conditions ( 1 , 1 , 1 ) (red color) and ( 1 , 1 , 1.001 ) (blue color).
Entropy 20 00012 g002
Figure 3. The Poincaré maps of system (1) with crossing sections: (a) Δ 1 ; (b) Δ 2 .
Figure 3. The Poincaré maps of system (1) with crossing sections: (a) Δ 1 ; (b) Δ 2 .
Entropy 20 00012 g003
Figure 4. The bifurcation diagrams (a) and Lyapunov exponents (b) of system (1) versus c ( 0 , 6 ) .
Figure 4. The bifurcation diagrams (a) and Lyapunov exponents (b) of system (1) versus c ( 0 , 6 ) .
Entropy 20 00012 g004
Figure 5. The phase portraits of system (1) with: (a) c = 0.8 ; (b) c = 1.2 ; (c) c = 1.4 ; (d) c = 1.6 ; (e) c = 2.9 ; (f) c = 3.1 ; (g) c = 3.2 ; (h) c = 3.6 .
Figure 5. The phase portraits of system (1) with: (a) c = 0.8 ; (b) c = 1.2 ; (c) c = 1.4 ; (d) c = 1.6 ; (e) c = 2.9 ; (f) c = 3.1 ; (g) c = 3.2 ; (h) c = 3.6 .
Entropy 20 00012 g005aEntropy 20 00012 g005b
Figure 6. The bifurcation diagrams (a) and Lyapunov exponents (b) of system (1) versus k ( 5 , 25 ) .
Figure 6. The bifurcation diagrams (a) and Lyapunov exponents (b) of system (1) versus k ( 5 , 25 ) .
Entropy 20 00012 g006
Figure 7. The phase portraits of system (1) with: (a) k = 5 ; (b) k = 15 ; (c) k = 18 ; (d) k = 25 .
Figure 7. The phase portraits of system (1) with: (a) k = 5 ; (b) k = 15 ; (c) k = 18 ; (d) k = 25 .
Entropy 20 00012 g007
Figure 8. The coexisting attractors of system (1): (a) projections on x y with k = 19 ; (b) time series of y with k = 19 ; (c) projections on x y with k = 20 ; (d) time series of y with k = 20 .
Figure 8. The coexisting attractors of system (1): (a) projections on x y with k = 19 ; (b) time series of y with k = 19 ; (c) projections on x y with k = 20 ; (d) time series of y with k = 20 .
Entropy 20 00012 g008
Figure 9. The phase portraits of the scaled system (8) for ( a , b , c , k ) = ( 2 , 8 , 2.9 , 4 ) : (a) x y ; (b) x z ; (c) y z .
Figure 9. The phase portraits of the scaled system (8) for ( a , b , c , k ) = ( 2 , 8 , 2.9 , 4 ) : (a) x y ; (b) x z ; (c) y z .
Entropy 20 00012 g009
Figure 10. The circuit diagram of system (8).
Figure 10. The circuit diagram of system (8).
Entropy 20 00012 g010
Figure 11. The experimental circuit of system (8).
Figure 11. The experimental circuit of system (8).
Entropy 20 00012 g011
Figure 12. The phase portraits of two coexisting attractors of system (8) on the oscilloscope for ( a , b , c , k ) = ( 2 , 8 , 2.9 , 4 ) : (a,b) x y ; (c,d) x z ; (e,f) y z .
Figure 12. The phase portraits of two coexisting attractors of system (8) on the oscilloscope for ( a , b , c , k ) = ( 2 , 8 , 2.9 , 4 ) : (a,b) x y ; (c,d) x z ; (e,f) y z .
Entropy 20 00012 g012
Table 1. Attractors of system (1) with different values of c.
Table 1. Attractors of system (1) with different values of c.
Value of cEquilibrium PointType of AttractorFigure
c = 0.8 Stable point : ( 0 , 0 , 5 ) A point attractorFigure 5a
c = 1.2 Saddle node : ( 0 , 0 , 3.3333 ) Stable point : ( ± 0.6325 , ± 0.3162 , 4 ) A pair of point attractorsFigure 5b
c = 1.4 Saddle node : ( 0 , 0 , 2.8571 ) Saddle focus : ( ± 0.8944 , ± 0.4472 , 4 ) A pair of limit cyclesFigure 5c
c = 1.6 Saddle node : ( 0 , 0 , 2.5 ) Saddle focus : ( ± 1.0954 , ± 0.5477 , 4 ) A symmetric limit cycleFigure 5d
c = 2.9 Saddle node : ( 0 , 0 , 1.3793 ) Saddle focus : ( ± 1.9494 , ± 0.9748 , 4 ) A pair of strange attractorsFigure 5e
c = 3.1 Saddle node : ( 0 , 0 , 1.2903 ) Saddle focus : ( ± 2.0494 , ± 1.0247 , 4 ) A pair of limit cyclesFigure 5f
c = 3.2 Saddle node : ( 0 , 0 , 1.25 ) Saddle focus : ( ± 2.0976 , ± 1.0488 , 4 ) A symmetric limit cycleFigure 5g
c = 3.6 Saddle node : ( 0 , 0 , 1.1111 ) Saddle focus : ( ± 2.2804 , ± 1.1402 , 4 ) A butterfly strange attractorFigure 5h
Table 2. The chaotic S-Box of system (1).
Table 2. The chaotic S-Box of system (1).
199305413814023013966011195762045423
254198501082319287182217285625321923221549
1021516886176248123212624914115482138174165
14562115150201104170148789719224725296211153
459840911091131961072098314412019175242208
17524610018185701971362352109321671105162149
88240312384217190731122432551282391212634
252265924413514253361461571171241161020560
17329272203321422412724114374615612261
110812337951774723622218515218015103234
206227169202137221177179163522456789802207
237183174101373957178194586921314718228
463522584141259513412963995510616121827
2502113242071934818418911411116716160188123
15513215813011816616416833159223644481190172
2122022918665251133221314311994199187200
Table 3. The comparison of different chaotic S-Boxes (BIC: bit independence criterion; SAC: strict avalanche criterion; DP: differential approach probability).
Table 3. The comparison of different chaotic S-Boxes (BIC: bit independence criterion; SAC: strict avalanche criterion; DP: differential approach probability).
S-BoxNonlinearityBIC-SACBICSACDP
MinAvgMaxNonlinearityMinAvgMax
Proposed S-Box1041051100.5028102.750.39060.50140.593710
Chen [37]1001031060.5024103.10.42180.50000.609314
Khan [38]961031060.5010100.30.39060.50390.625012
Wang [39]1021041060.5070103.80.48500.50720.515012
Ozkaynak [40]100103.21060.5009103.70.42180.50480.593810
Jakimoski [41]98103.21080.5031104.20.37610.50580.597512
Hussain [42]102105.21080.5053104.20.40800.50500.589412
Tang [43]99103.41060.4995103.30.41400.49870.601510

Share and Cite

MDPI and ACS Style

Lai, Q.; Akgul, A.; Li, C.; Xu, G.; Çavuşoğlu, Ü. A New Chaotic System with Multiple Attractors: Dynamic Analysis, Circuit Realization and S-Box Design. Entropy 2018, 20, 12. https://doi.org/10.3390/e20010012

AMA Style

Lai Q, Akgul A, Li C, Xu G, Çavuşoğlu Ü. A New Chaotic System with Multiple Attractors: Dynamic Analysis, Circuit Realization and S-Box Design. Entropy. 2018; 20(1):12. https://doi.org/10.3390/e20010012

Chicago/Turabian Style

Lai, Qiang, Akif Akgul, Chunbiao Li, Guanghui Xu, and Ünal Çavuşoğlu. 2018. "A New Chaotic System with Multiple Attractors: Dynamic Analysis, Circuit Realization and S-Box Design" Entropy 20, no. 1: 12. https://doi.org/10.3390/e20010012

APA Style

Lai, Q., Akgul, A., Li, C., Xu, G., & Çavuşoğlu, Ü. (2018). A New Chaotic System with Multiple Attractors: Dynamic Analysis, Circuit Realization and S-Box Design. Entropy, 20(1), 12. https://doi.org/10.3390/e20010012

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop