# Analyses and Encryption Implementation of a New Chaotic System Based on Semitensor Product

Authors: Rui Wang; Peifeng Du; Wenqi Zhong; Han Han; Hui Sun
Journal: Complexity
 (2020)

---

## Abstract

Semitensor product theory can deal with matrices multiplication with different numbers of columns and rows. Therefore, a new chaotic system for different high dimensions can be created by employing a semitensor product of chaotic systems with different dimensions, so that more channels can be selected for encryption. This paper proposes a new chaotic system generated by semitensor product applied on Qi and Lorenz systems. The corresponding dynamic characteristics of the new system are discussed in this paper to verify the existences of different attractors. The detailed algorithms are illustrated in this paper. The FPGA hardware encryption implementations are also elaborated and conducted. Correspondingly, the randomness tests are realized as well, and compared to that of the individual Qi system and Lorenz system, the proposed system in this paper owns the better randomness characteristic. The statistical analyses and differential and correlation analyses are also discussed.


---

## Body

## 1. Introduction

With the coming of 5G technology, more and more information is transformed by video, and video information security becomes more and more important in practical applications especially for long-distance transmission [1, 2]. The existing traditional encryption methods, such as DES and AES, however, cannot meet the high requirements for real time [3]. Therefore, it is necessary to focus on making progresses in the encryption technology in order to meet the real-time requirements.People never stop studying the chaotic systems since Lorenz proposed the first chaotic system. Except for the typical chaotic systems, such as Chen, Lv, and Qi systems, some new different types of chaotic systems are generated as well, such as multistable chaotic hyperjerk system [4], a class of factional-order partial differential systems [5], multistable modified fourth-order autonomous Chua’s system [6], coexisting chaotic attractors chaotic systems [7–9], and chaotic system generation with memristors [10]. The authors in reference [11] present a MDMBCAs design method without reconstructing nonlinear function. Correspondingly, chaotic systems are employed in different areas such as modeling neurodegenerative disease [12] and image and video encryptions [13–18]. It is known that the characteristics of chaotic systems, such as pseudorandomness and sensitivity to initial values, meet the requirements of encryption discussed in the Shannon’s epoch-making paper “Communication Theory of Secrecy Systems.” Consequently, it is hot for researchers to focus on the image and video data encryption, where the encrypted sequences are generated by chaotic systems in order to satisfy the need for remote communications and other applications. Multiple hardware platforms are implemented on encryptions such as FPGA, ARM, or circuits implementation [19–32]. Thus, different encryption methods based on various hardware platforms are proposed in many articles [19]. The authors in reference [20] propose chaos encryption and decryption operated on FPGA and tested by TESTU01. The study in [21, 22] implements scrambling and antisqueezing of RGB three primary color pixel position and video chaotic encryption and decryption of pixel value on arm and a digital programmable audio encryption based on chaos system on FPGA. The effectiveness of chaotic secure communication system method is proved by using adder and multiplier of FPGA [23]. A generalized improved chaotic transformation mapping is proposed in [24]. Based on this mapping, the speech encryption of position transformation network is implemented on FPGA. Meanwhile, [25] realizes FPGA circuit output of three-dimensional chaotic system without balancing points on FPGA. The study in [26] implements the multibutterfly chaotic attractor problem on FPGA. The study in [27] proposes a Kolmogorov-type three-dimensional chaotic system and implements the chaotic system on FPGA. The study in [28] implements an application of high-dimensional digital chaos system (HDDCS) in image encryption in a limited precision range on FPGA. The study in [29] proposes a fractional order three-dimensional chaotic system with four wing chaotic attractors implemented on FPGA. The study in [30] proposes a sinusoidal chaotic model (SCM) and uses FPGA to implement chaotic mapping to verify its complexity and larger chaotic range. SOPC technology is used to realize the video processing of FPGA and the data receiving and sending of ARM [15]. A method of generating pseudorandom number based on chaotic system is proposed and implemented on FPGA [31]. In addition to FPGA and arm, [32, 33] also use improved modular circuit design in hyperchaotic system. The study in [34] studies the security of the latest three-dimensional chaotic self-synchronization flow secret key and a single secret key algorithm. The study in [35] proposes a method for a high-dimension chaotic system implemented on FPGA and also provides comparison among different methods, such as Real Domain Chaotic System (RDCS), Integer Domain Chaotic System (IDCS), Chaotic Bitwise Dynamical System (CBDS), and Higher-Dimensional Digital Chaotic Systems (HDDCS) implemented on FPGA. Compared to these methods, the proposed method can solve the dynamical degradation issue. The study in [36] discusses the Orthogonal Frequency Division Multiplexing-Passive Optical Network (OFDM-PON) method which initiates a method for real-time video encryption with chaotic systems. Chen. et al. design an encryption algorithm using chaotic control methods and implement this method on FPGA and ARM hardware platforms. Furthermore, the comparisons of the encryption method based on ARM and FPGA are discussed by mixing the advantages of each platform to achieve better real-time performance [15, 23, 24].Semitensor product is a matrix operation first proposed by Cheng et al. [37]. This method breaks the restriction of matrix product; that is, the column dimension of the front matrix must be the same with the row dimension of the back matrix. Then semitensor product realizes the multiplication for matrices with different dimensions. Therefore, this method makes the matrices product more easily and can be applied in much wider areas. Semitensor product method is also extended in nonlinear issues and multiple areas such Boolean network control, game theory, compressed sensing, and data fusion [38–40]. The study in [41] provides the literature review for the applications of semitensor product in engineering areas. This paper is inspired by the typical characteristics of semitensor product method mentioned previously which provides a new idea to generate chaotic systems. The new chaotic systems can be employed in real-time video encryption areas as well.The main contribution of this paper is to employ the unique characteristic of the semitensor product to form a new chaotic system with different-order chaotic systems, Qi and Lorenz systems, in order to enhance the randomness of the sequence. Then the dynamic characteristics of the new chaotic system are analyzed, and the system is applied in video encryption. When compared to the individual chaotic system, the new one constructed by semitensor product has the overwhelmed pseudorandomness.The rest of the paper is arranged as follows. Section2 presents a new chaotic system formed by semitensor product theory. Furthermore, the corresponding dynamic characteristics of the system are analyzed. Section 3 provides the detailed encryption implementation based on FPGA with the new chaotic system. NIST test and the corresponding stochastic analysis are conducted as well in this section. The conclusion of the paper is drawn in Section 4.


## 2. A New Chaotic System Based on the Semitensor Product Theory

### 2.1. Preliminaries of Semitensor Product

Normally, the semitensor product operation includes left semitensor product operation and right semitensor product operation. Left semitensor product operation meets the multiple-dimension condition; that is,n = t × p (t ∈ Ν+). Or if p = s × n (s ∈ Ν+), the operation is right semitensor product operation.Lemma 1.
Assume matrixA is m × n, matrix B is p × q, and n = t × p (t ∈ Ν+) [42]. Let A be divided into a blocking matrix [A1, …, At], where Ai (i = 1, …, t) is an m × p matrix. Then the left semitensor product is defined as(1)Am×n⋉Bp×q=A1m×pBp×q,A2m×pBp×q,A3m×pBp×q,…,Atm×pBp×qm×tq,where “⋉” is the left semitensor product.Lemma 2.
IfA ∈ Mm×tp and B ∈ Mp×q, then(2)A⋉B=AB⊗It,where ⊗ is the Kronecker product of matrices [42].


### 2.2. A New Chaotic System Generated by Semitensor Product Theory

Qi system is a hyperchaotic system with two positive Lyapunov exponents, 3 and 13, under certain conditions [28]. And it could be used for secure communication due to its large positive Lyapunov exponents. It is known that Qi system is described as follows:(3)x˙Q1=axQ2−xQ1+xQ2xQ3,x˙Q2=bxQ1+xQ2−xQ1xQ3,x˙Q3=−cxQ3−exQ4+xQ1xQ2,x˙Q4=−dxQ4+fxQ3+xQ1xQ2,where xQi (i = 1, 2, 3, 4) is the state variable and a, b, c, d, and f are the related system parameters. System (3) is a hyperchaotic system, when 49 ≤ a ≤55, 20 ≤ b ≤ 24, c = 13, d = 8, e = 33, and f = 30.The first chaotic system under study is a Lorenz chaotic system [28]. The dynamics of the system are shown in(4)x˙=σy−x,y˙=rx−y−xz,z˙=xy−βz,where x, y, and z are state variables and σ, r, and β are the related system parameters. The typical system parameters for Lorenz chaotic system are selected as σ = 10, r = 28, and β = 8/3.It is relaxed for semitensor product operation only to satisfy the multiple-dimension condition. Therefore, different numbers state variables of systems can be selected and conduct semitensor operation. For example, this paper selects a two-dimension state variable (xy)T of Lorenz system and a four-dimension state variable (xQ1xQ2xQ3xQ4)T of Qi system to operate semitensor product. The result is shown as follows:(5)xy⋉xQ1xQ2xQ3xQ4=xxQ1xQ2xQ3xQ4TyxQ1xQ2xQ3xQ4TT.It is observed that the result of equation (5) is eight-dimension column vector which is equivalent to the new system state variable vector (x1x2x3x4x5x6x7x8)T; that is,(6)x1x2x3x4x5x6x7x8=xxQ1xxQ2xxQ3xxQ4yxQ1yxQ2yxQ3yxQ4.Differentiate each state variable in equation (6), and substitute equations (3) and (4) into the result. Then the following equation can be derived:(7)x˙1x˙2x˙3x˙4x˙5x˙6x˙7x˙8=x˙xQ1+xx˙Q1x˙xQ2+xx˙Q2x˙xQ3+xx˙Q3x˙xQ4+xx˙Q4y˙xQ1+yx˙Q1y˙xQ2+yx˙Q2y˙xQ3+yx˙Q3y˙xQ4+yx˙Q4=σy−xxQ1+axxQ2−xQ1+xxQ2xQ3σy−xxQ2+bxxQ1+xQ2−xxQ1xQ3σy−xxQ3−cxxQ3−exxQ4+xxQ1xQ2σy−xxQ4−dxxQ4+fxxQ3+xxQ1xQ2rx−y−xzxQ1+ayxQ2−xQ1+yxQ2xQ3rx−y−xzxQ2+byxQ1+xQ2−yxQ1xQ3rx−y−xzxQ3−cyxQ3−eyxQ4+yxQ1xQ2rx−y−xzxQ4−dyxQ4+fyxQ3+yxQ1xQ2=σx5−x1+ax2−x1+x2x3xσx6−x2+bx2+x1−x1x3xσx−7x3−cx3−ex4+x1x2xσx−8x4−dx4+fx3+x1x2xrx1−x5−x1z+ax6−x5+x6x7xrx2−x6−x2z+bx5+x6−x5x7xrx3−x7−x3z−cx7−ex8+x5x6xrx4−x8−x4z−dx8+fx7+x5x6x.It is obvious that the dynamics of (7) still include three state variables of Lorenz system, x, y, and z. Therefore, insert equation (4) into equation (7) and then form a complete eleven-dimension system as illustrated in the following:(8)x˙1=σx5−x1+ax2−x1+x2x3x,x˙2=σx6−x2+bx2+x1−x1x3x,x˙3=σx−7x3−cx3−ex4+x1x2x,x˙4=σx−8x4−dx4+fx3+x1x2x,x˙5=rx1−x5−x1z+ax6−x5+x6x7y,x˙6=rx2−x6−x2z+bx5+x6−x5x7y,x˙7=rx3−x7−x3z−cx7−ex8+x5x6y,x˙8=rx4−x8−x4z−dx8+fx7+x5x6y,x˙=σy−x,y˙=rx−y−xz,z˙=xy−βz.As seen from equation (8), if one substitutes x⟶−x, y⟶−y, and z⟶z, z˙=−x−y−βz=xy−βz, it proves that it is symmetric with respect to z variable for x and y.


### 2.3. Numerical Analysis of the New System

The paper analyzes some dynamics characteristics of the new system including symmetry, dissipativity, equilibrium point, equilibria, bifurcation diagram, Lyapunov diagram, and phase portraits.


#### 2.3.1. Symmetry

As described in system (8), the system is symmetry with respect to z-axis since the system is invariant under the coordinate transformations: x1,x2,x3,x4,x5,x6,x7,x8,x,y,z⟶−x1,−x2,−x3,−x4,−x5,−x6,−x7,−x8,−x,−y,z.


#### 2.3.2. Dissipativity

The divergence of system (12) is given by(9)∇⋅f=∂f1∂x1+∂f2∂x2+⋯+∂f8∂x8+∂f9∂x+∂f10∂y+∂f11∂z=−5σ−2a+2b−2c−2d−5−β,and when −5σ−2a+2b−2c−2d−5−β<0, the system undergoes dissipation.


#### 2.3.3. Equilibria

As shown in system (8), x, y, and z could not be zero when calculating equilibria. Then the equilibria of system (8) are 0,0,0,0,0,0,0,0,±βr−1,±βr−1,r−1. One has(10)J1,2=−σ−aa00σ000000bb−σ000σ0000000−σ−c−e00σ000000f−σ−d000σ0001000−1−aa000000100bb−100000001000−1−c−e000000100f−1−d00000000000−σ00000000001−1000000000±βr−1±βr−1βequilibriaThe corresponding polynomial is(11)fλ=λλ+βλ−1f1λwhere f1λ is an eighth-order polynomial. It is obvious that at least 0, 1, and −β are eigenvalues of system (8) for the these equilibrium points; therefore, not each real part of the eigenvalues is negative. Then it can be concluded that these are not stable equilibrium points.


#### 2.3.4. Bifurcation Diagram, Lyapunov Diagram, and Phase Portraits

It is known that when 49 ≤a ≤ 55, 20 ≤ b ≤ 24, c = 13, d = 8, e = 33, and f = 30, Qi system is a hyperchaotic system. When σ = 10, r = 28, and β = 8/3, Lorenz system is a chaotic system. Therefore, the paper selects the parameters a = 50, c = 13, d = 8, e = 33, f = 30, σ = 10, r = 28, and β = 8/3 and varies b to analyze the bifurcation of system (12) as shown in Figure 1(a). As the bifurcation diagram shows, the system demonstrates the chaotic characteristics when b∈−5,26. The corresponding Lyapunov diagram is illustrated in Figure 1(b). Furthermore, partial phase portraits of system (7) for different initials when b = 24 are shown in Figures 1(c). One has(12)x˙1=10x5−x1+50x2−x1+x2x3x,x˙2=10x6−x2+bx2+x1−x1x3x,x˙3=10x−7x3−13x3−33x4+x1x2x,x˙4=10x−8x4−8x4+30x3+x1x2x,x˙5=28x1−x5−x1z+50x6−x5+x6x7y,x˙6=28x2−x6−x2z+bx5+x6−x5x7y,x˙7=28x3−x7−x3z−13x7−33x8+x5x6y,x˙8=28x4−x8−x4z−8x8+30x7+x5x6y,x˙=10y−x,y˙=28x−y−xz,z˙=xy−83z.Figure 1
Bifurcation diagram along withb variation and partial phase portraits for different initial values (blue line for the first initial value set and red line for the second initial value set).
(a)(b)(c)(d)(e)(f)Figures1(c)–1(f) illustrate different phase portraits including x1 versus x2, x2 versus x4, x3 versus x, and x versusz when b = 24 for two initial value sets, the initial values for the blue line phase portraits are 0.01418, 0.04217, 0.09157, 0.07922, 0.09594, 0.06557, 0.00357, 0.08491, 0.09339, 0.06787, and 0.07577, and those for the red line phase portraits are 0.01417, 0.04218, 0.09156, 0.07921, 0.09593, 0.06558, 0.00356, 0.08492, 0.09338, 0.06788, and 0.07576. These portraits demonstrate that system (12) has obvious chaotic attractors and approaches periodic characteristics as initial values changes.


## 2.1. Preliminaries of Semitensor Product

Normally, the semitensor product operation includes left semitensor product operation and right semitensor product operation. Left semitensor product operation meets the multiple-dimension condition; that is,n = t × p (t ∈ Ν+). Or if p = s × n (s ∈ Ν+), the operation is right semitensor product operation.Lemma 1.
Assume matrixA is m × n, matrix B is p × q, and n = t × p (t ∈ Ν+) [42]. Let A be divided into a blocking matrix [A1, …, At], where Ai (i = 1, …, t) is an m × p matrix. Then the left semitensor product is defined as(1)Am×n⋉Bp×q=A1m×pBp×q,A2m×pBp×q,A3m×pBp×q,…,Atm×pBp×qm×tq,where “⋉” is the left semitensor product.Lemma 2.
IfA ∈ Mm×tp and B ∈ Mp×q, then(2)A⋉B=AB⊗It,where ⊗ is the Kronecker product of matrices [42].


## 2.2. A New Chaotic System Generated by Semitensor Product Theory

Qi system is a hyperchaotic system with two positive Lyapunov exponents, 3 and 13, under certain conditions [28]. And it could be used for secure communication due to its large positive Lyapunov exponents. It is known that Qi system is described as follows:(3)x˙Q1=axQ2−xQ1+xQ2xQ3,x˙Q2=bxQ1+xQ2−xQ1xQ3,x˙Q3=−cxQ3−exQ4+xQ1xQ2,x˙Q4=−dxQ4+fxQ3+xQ1xQ2,where xQi (i = 1, 2, 3, 4) is the state variable and a, b, c, d, and f are the related system parameters. System (3) is a hyperchaotic system, when 49 ≤ a ≤55, 20 ≤ b ≤ 24, c = 13, d = 8, e = 33, and f = 30.The first chaotic system under study is a Lorenz chaotic system [28]. The dynamics of the system are shown in(4)x˙=σy−x,y˙=rx−y−xz,z˙=xy−βz,where x, y, and z are state variables and σ, r, and β are the related system parameters. The typical system parameters for Lorenz chaotic system are selected as σ = 10, r = 28, and β = 8/3.It is relaxed for semitensor product operation only to satisfy the multiple-dimension condition. Therefore, different numbers state variables of systems can be selected and conduct semitensor operation. For example, this paper selects a two-dimension state variable (xy)T of Lorenz system and a four-dimension state variable (xQ1xQ2xQ3xQ4)T of Qi system to operate semitensor product. The result is shown as follows:(5)xy⋉xQ1xQ2xQ3xQ4=xxQ1xQ2xQ3xQ4TyxQ1xQ2xQ3xQ4TT.It is observed that the result of equation (5) is eight-dimension column vector which is equivalent to the new system state variable vector (x1x2x3x4x5x6x7x8)T; that is,(6)x1x2x3x4x5x6x7x8=xxQ1xxQ2xxQ3xxQ4yxQ1yxQ2yxQ3yxQ4.Differentiate each state variable in equation (6), and substitute equations (3) and (4) into the result. Then the following equation can be derived:(7)x˙1x˙2x˙3x˙4x˙5x˙6x˙7x˙8=x˙xQ1+xx˙Q1x˙xQ2+xx˙Q2x˙xQ3+xx˙Q3x˙xQ4+xx˙Q4y˙xQ1+yx˙Q1y˙xQ2+yx˙Q2y˙xQ3+yx˙Q3y˙xQ4+yx˙Q4=σy−xxQ1+axxQ2−xQ1+xxQ2xQ3σy−xxQ2+bxxQ1+xQ2−xxQ1xQ3σy−xxQ3−cxxQ3−exxQ4+xxQ1xQ2σy−xxQ4−dxxQ4+fxxQ3+xxQ1xQ2rx−y−xzxQ1+ayxQ2−xQ1+yxQ2xQ3rx−y−xzxQ2+byxQ1+xQ2−yxQ1xQ3rx−y−xzxQ3−cyxQ3−eyxQ4+yxQ1xQ2rx−y−xzxQ4−dyxQ4+fyxQ3+yxQ1xQ2=σx5−x1+ax2−x1+x2x3xσx6−x2+bx2+x1−x1x3xσx−7x3−cx3−ex4+x1x2xσx−8x4−dx4+fx3+x1x2xrx1−x5−x1z+ax6−x5+x6x7xrx2−x6−x2z+bx5+x6−x5x7xrx3−x7−x3z−cx7−ex8+x5x6xrx4−x8−x4z−dx8+fx7+x5x6x.It is obvious that the dynamics of (7) still include three state variables of Lorenz system, x, y, and z. Therefore, insert equation (4) into equation (7) and then form a complete eleven-dimension system as illustrated in the following:(8)x˙1=σx5−x1+ax2−x1+x2x3x,x˙2=σx6−x2+bx2+x1−x1x3x,x˙3=σx−7x3−cx3−ex4+x1x2x,x˙4=σx−8x4−dx4+fx3+x1x2x,x˙5=rx1−x5−x1z+ax6−x5+x6x7y,x˙6=rx2−x6−x2z+bx5+x6−x5x7y,x˙7=rx3−x7−x3z−cx7−ex8+x5x6y,x˙8=rx4−x8−x4z−dx8+fx7+x5x6y,x˙=σy−x,y˙=rx−y−xz,z˙=xy−βz.As seen from equation (8), if one substitutes x⟶−x, y⟶−y, and z⟶z, z˙=−x−y−βz=xy−βz, it proves that it is symmetric with respect to z variable for x and y.


## 2.3. Numerical Analysis of the New System

The paper analyzes some dynamics characteristics of the new system including symmetry, dissipativity, equilibrium point, equilibria, bifurcation diagram, Lyapunov diagram, and phase portraits.


### 2.3.1. Symmetry

As described in system (8), the system is symmetry with respect to z-axis since the system is invariant under the coordinate transformations: x1,x2,x3,x4,x5,x6,x7,x8,x,y,z⟶−x1,−x2,−x3,−x4,−x5,−x6,−x7,−x8,−x,−y,z.


### 2.3.2. Dissipativity

The divergence of system (12) is given by(9)∇⋅f=∂f1∂x1+∂f2∂x2+⋯+∂f8∂x8+∂f9∂x+∂f10∂y+∂f11∂z=−5σ−2a+2b−2c−2d−5−β,and when −5σ−2a+2b−2c−2d−5−β<0, the system undergoes dissipation.


### 2.3.3. Equilibria

As shown in system (8), x, y, and z could not be zero when calculating equilibria. Then the equilibria of system (8) are 0,0,0,0,0,0,0,0,±βr−1,±βr−1,r−1. One has(10)J1,2=−σ−aa00σ000000bb−σ000σ0000000−σ−c−e00σ000000f−σ−d000σ0001000−1−aa000000100bb−100000001000−1−c−e000000100f−1−d00000000000−σ00000000001−1000000000±βr−1±βr−1βequilibriaThe corresponding polynomial is(11)fλ=λλ+βλ−1f1λwhere f1λ is an eighth-order polynomial. It is obvious that at least 0, 1, and −β are eigenvalues of system (8) for the these equilibrium points; therefore, not each real part of the eigenvalues is negative. Then it can be concluded that these are not stable equilibrium points.


### 2.3.4. Bifurcation Diagram, Lyapunov Diagram, and Phase Portraits

It is known that when 49 ≤a ≤ 55, 20 ≤ b ≤ 24, c = 13, d = 8, e = 33, and f = 30, Qi system is a hyperchaotic system. When σ = 10, r = 28, and β = 8/3, Lorenz system is a chaotic system. Therefore, the paper selects the parameters a = 50, c = 13, d = 8, e = 33, f = 30, σ = 10, r = 28, and β = 8/3 and varies b to analyze the bifurcation of system (12) as shown in Figure 1(a). As the bifurcation diagram shows, the system demonstrates the chaotic characteristics when b∈−5,26. The corresponding Lyapunov diagram is illustrated in Figure 1(b). Furthermore, partial phase portraits of system (7) for different initials when b = 24 are shown in Figures 1(c). One has(12)x˙1=10x5−x1+50x2−x1+x2x3x,x˙2=10x6−x2+bx2+x1−x1x3x,x˙3=10x−7x3−13x3−33x4+x1x2x,x˙4=10x−8x4−8x4+30x3+x1x2x,x˙5=28x1−x5−x1z+50x6−x5+x6x7y,x˙6=28x2−x6−x2z+bx5+x6−x5x7y,x˙7=28x3−x7−x3z−13x7−33x8+x5x6y,x˙8=28x4−x8−x4z−8x8+30x7+x5x6y,x˙=10y−x,y˙=28x−y−xz,z˙=xy−83z.Figure 1
Bifurcation diagram along withb variation and partial phase portraits for different initial values (blue line for the first initial value set and red line for the second initial value set).
(a)(b)(c)(d)(e)(f)Figures1(c)–1(f) illustrate different phase portraits including x1 versus x2, x2 versus x4, x3 versus x, and x versusz when b = 24 for two initial value sets, the initial values for the blue line phase portraits are 0.01418, 0.04217, 0.09157, 0.07922, 0.09594, 0.06557, 0.00357, 0.08491, 0.09339, 0.06787, and 0.07577, and those for the red line phase portraits are 0.01417, 0.04218, 0.09156, 0.07921, 0.09593, 0.06558, 0.00356, 0.08492, 0.09338, 0.06788, and 0.07576. These portraits demonstrate that system (12) has obvious chaotic attractors and approaches periodic characteristics as initial values changes.


## 2.3.1. Symmetry

As described in system (8), the system is symmetry with respect to z-axis since the system is invariant under the coordinate transformations: x1,x2,x3,x4,x5,x6,x7,x8,x,y,z⟶−x1,−x2,−x3,−x4,−x5,−x6,−x7,−x8,−x,−y,z.


## 2.3.2. Dissipativity

The divergence of system (12) is given by(9)∇⋅f=∂f1∂x1+∂f2∂x2+⋯+∂f8∂x8+∂f9∂x+∂f10∂y+∂f11∂z=−5σ−2a+2b−2c−2d−5−β,and when −5σ−2a+2b−2c−2d−5−β<0, the system undergoes dissipation.


## 2.3.3. Equilibria

As shown in system (8), x, y, and z could not be zero when calculating equilibria. Then the equilibria of system (8) are 0,0,0,0,0,0,0,0,±βr−1,±βr−1,r−1. One has(10)J1,2=−σ−aa00σ000000bb−σ000σ0000000−σ−c−e00σ000000f−σ−d000σ0001000−1−aa000000100bb−100000001000−1−c−e000000100f−1−d00000000000−σ00000000001−1000000000±βr−1±βr−1βequilibriaThe corresponding polynomial is(11)fλ=λλ+βλ−1f1λwhere f1λ is an eighth-order polynomial. It is obvious that at least 0, 1, and −β are eigenvalues of system (8) for the these equilibrium points; therefore, not each real part of the eigenvalues is negative. Then it can be concluded that these are not stable equilibrium points.


## 2.3.4. Bifurcation Diagram, Lyapunov Diagram, and Phase Portraits

It is known that when 49 ≤a ≤ 55, 20 ≤ b ≤ 24, c = 13, d = 8, e = 33, and f = 30, Qi system is a hyperchaotic system. When σ = 10, r = 28, and β = 8/3, Lorenz system is a chaotic system. Therefore, the paper selects the parameters a = 50, c = 13, d = 8, e = 33, f = 30, σ = 10, r = 28, and β = 8/3 and varies b to analyze the bifurcation of system (12) as shown in Figure 1(a). As the bifurcation diagram shows, the system demonstrates the chaotic characteristics when b∈−5,26. The corresponding Lyapunov diagram is illustrated in Figure 1(b). Furthermore, partial phase portraits of system (7) for different initials when b = 24 are shown in Figures 1(c). One has(12)x˙1=10x5−x1+50x2−x1+x2x3x,x˙2=10x6−x2+bx2+x1−x1x3x,x˙3=10x−7x3−13x3−33x4+x1x2x,x˙4=10x−8x4−8x4+30x3+x1x2x,x˙5=28x1−x5−x1z+50x6−x5+x6x7y,x˙6=28x2−x6−x2z+bx5+x6−x5x7y,x˙7=28x3−x7−x3z−13x7−33x8+x5x6y,x˙8=28x4−x8−x4z−8x8+30x7+x5x6y,x˙=10y−x,y˙=28x−y−xz,z˙=xy−83z.Figure 1
Bifurcation diagram along withb variation and partial phase portraits for different initial values (blue line for the first initial value set and red line for the second initial value set).
(a)(b)(c)(d)(e)(f)Figures1(c)–1(f) illustrate different phase portraits including x1 versus x2, x2 versus x4, x3 versus x, and x versusz when b = 24 for two initial value sets, the initial values for the blue line phase portraits are 0.01418, 0.04217, 0.09157, 0.07922, 0.09594, 0.06557, 0.00357, 0.08491, 0.09339, 0.06787, and 0.07577, and those for the red line phase portraits are 0.01417, 0.04218, 0.09156, 0.07921, 0.09593, 0.06558, 0.00356, 0.08492, 0.09338, 0.06788, and 0.07576. These portraits demonstrate that system (12) has obvious chaotic attractors and approaches periodic characteristics as initial values changes.


## 3. Encryption Implementation with the New Chaotic System Based on FPGA

This paper employs the random sequence of system (12) as the random sequence to encrypt video data and realize the hardware implement on FPGA. Figure 2 is the FPGA hardware diagram used for the encryption. The main components are HDMI, ZYNQ, JTAG, and source interface. The video is collected from JTAG, then the encryption algorithm is performed in ZYNQ powered by 5 V DC, and the outputs will be shown in the monitor through HDMI.Figure 2
FPGA hardware diagram.The encryption algorithm is described in the following, and the corresponding block diagram is demonstrated in Figure3:Step 1: to generate the random sequences for each state variable for both discretized Qi system and Lorenz system, respectively.Step 2: to generate the random sequence for the new system (12) constructed by semitensor product operation on (xQ1xQ2xQ3xQ4)T and (xy)T.Step 3: to generate the sequencexi=(xi1,xi2, xi3,…, xi32) by the new system (i = 1, 2, …, 8, j = 1, 2, …, 32), where xij is a binary number, i represents the number of state variables, and j is the bit number for each state variable. Choose a sequence xi with fixed bits from t to q; that is,(13)cin=ximod2qmod2t−q,i=1,2,&,8,1≤t<q≤32.Figure 3
Block diagram of encryption algorithm.Make an XOR operation onci (n) and divide video data based on pixels; that is,(14)mn=ximod2t−1mod2t−q⊕m,where ⊕ is the XOR operation.


### 3.1. Discretization for the New System and Its Implementation Based on FPGA

In the hardware experiment, it is impossible to implement the continuous Lorenz and Qi chaotic systems because of limitation of the bit width in FPGA. Therefore, it is necessary to discretize continuous system first. Multiple methods can be used to discretize a differential equation such as Euler method, improved Euler method, and Runge-Kutta method. To meet the requirement of real-time performance and the limitation of hardware implementation, Euler method is used to discretize the differential equations due to its low computation complexity. First, Euler method is used to discretize Qi and Lorenz systems, respectively. The corresponding process of Qi system is proposed as follows:(15)xQ1n+1−xQ1nτ=axQ2n−xQ1n+xQ2nxQ3n,xQ2n+1−xQ2nτ=bxQ1n+xQ2n−xQ1nxQ3n,xQ3n+1−xQ3nτ=−cxQ3n−exQ4n+xQ1nxQ2n,xQ4n+1−xQ4nτ=−dxQ4n+fxQ3n+xQ1nxQ2n.Then, the iteration equations of Qi system are shown in(16)xQ1n+1=aτxQ2n+1−aτxQ1n+τxQ2nxQ3n,xQ2n+1=bτxQ1n+1+bτxQ2n−τxQ1nxQ3n,xQ3n+1=1−cτxQ3n−eτxQ4n+τxQ1nxQ2n,xQ4n+1=1−dτxQ4n+fτxQ3n+τxQ1nxQ2n.Similarly, the discrete Lorenz system is (17)xn+1−xnτ=σyn−xn,yn+1−ynτ=rxn−yn−xnznzn+1−znτ=xnyn−βzn.,Correspondingly, the iteration equations of Lorenz system are(18)xn+1=στyn+1−στxn,yn+1=rτxn+1−τyn−τxnzn,zn+1=τxnyn+1−βτzn.In general, FPGA can store float data and fixed-point data. Since fixed-point data require less computing resources than that of float data, this paper uses 64-bit fixed-point number to represent the data. The detailed data format of 64-bit fixed-point numbers is shown in Figure4.Figure. 4
Data format for 64-bit fixed-point numbers.In Figure4, I represents the integer part of 64-bit fixed-point numbers, and f is the fractional part.As mentioned before, because of the limitation of bit width in FPGA, all data are truncated numbers in hardware implementation. Therefore, the Qi and Lorenz system becomes(19)xQ1n+1=aτxQ2n+1−aτxQ1n+τxQ2nxQ3n,xQ2n+1=bτxQ1n+1+bτxQ2n−τxQ1nxQ3n,xQ3n+1=1−cτxQ3n−eτxQ4n+τxQ2nxQ1n,xQ4n+1=1−dτxQ4n+fτxQ3n+τxQ1nxQ2n,(20)xn+1=στyn+1−στxn,yn+1=rτxn+1−τyn−τxnzn,zn+1=τxnyn+1−βτzn.Let the iteration step beτ = 0.00001 and use the same parameters in system (12). Then substitute them into (19) and (20), respectively. Therefore, Qi system and Lorenz system are changed as follows:(21)xQ1n+1=0.9995xQ2n+0.0005xQ1n+0.00001xQ2nxQ3n,xQ2n+1=0.0002xQ1n+1.0002xQ2n−0.00001xQ1nxQ3n,xQ3n+1=0.99987xQ3n−0.00033xQ4n+0.00001xQ2nxQ1n,xQ4n+1=0.00008xQ4n+0.9997xQ3n+0.00001xQ1nxQ2n,(22)xn+1=0.0001yn+0.9999xn,yn+1=0.00028xn+0.99999yn−0.00001xnzn,zn+1=0.00001xnyn+0.9999733zn.To iterate Qi system and Lorenz system and make semitensor product operation on these two systems after each iteration, respectively, the discretized first 8 state variables of the new system are obtained:(23)x1n+1=xn+1×xQ1n+1,x2n+1=xn+1×xQ2n+1,x3n+1=xn+1×xQ3n+1,x4n+1=xn+1×xQ4n+1,x5n+1=yn+1×xQ1n+1,x6n+1=yn+1×xQ2n+1,x7n+1=yn+1×xQ3n+1,x8n+1=yn+1×xQ4n+1,where xi(n + 1) and xi (n) are system state variables. yn+1 is the approximate value of y (n + 1) using fixed-point number.


### 3.2. Implementation and Analysis of Encryption Algorithm of the New Chaotic System

In order to ensure the randomness of the random sequence, therefore, select the low bits fromt to q as shown in Figure 5. The positions of these bits are not close to those of sign and exponent bits. Then the chosen random encryption sequence, ci (n), is shown in equation (17). This paper selects t = 1 and q = 6:(24)cin=modxin2t−1,2q−t+1,i=1,2,…,8.Figure 5
The schematics of numbered data bits.Random sequences which are selected from eight states based on the method mentioned previously are combined to generate the random sequence,c (n):(25)cn=c1n,c2v,…,c8n.In order to resist the differential attack and decrease the correlation between adjacent random sequences, the paper selects the very first iteration sequence among everyN iterations and stacks these selected sequences to construct a random sequence, c (n), as shown in equation (18). This can improve the randomness of the random sequence.Next, the random sequence,c (n), conducts XOR operation with the divided video data. Since a frame video data includes tricolor integer sequences, R (n), G (n), and B (n), these three sequences will be encrypted simultaneously after changing the random sequence, c (n), into three columns evenly, c1 (n), c2 (n), and c3 (n):(26)p1n=c1n⊕Rn,p2n=c2n⊕Gn,p3n=c3n⊕Bn,where p1 (n), p2 (n), and p3 (n) are encrypted sequences and ⊕ is an XOR operation. One has(27)R^n=modx^1n2t,2q−t+1⊕p1n=modx^1n2t,2q−t+1⊕c1n⊕Rn,G^n=modx^2n2t,2q−t+1⊕p2n=modx^2n2t,2q−t+1⊕c1n⊕Gn,B^n=modx^3n2t,2q−t+1⊕p3n=modmodx^3n,2t,2t−q⊕c3n⊕Bn,where x^p′n,p′=1,2,3 are receiver terminal sequences.


### 3.3. Analysis for NIST Test

NIST test is provided by National Institute of Standards and Technology, and it is a standard to test the randomness of a random sequence. According to the encryption algorithm in this paper,c (n) in equation (25) should be tested by NIST standard. The comparisons of the random sequence among the new system, Qi system, and Lorenz system, c (n), cL (n), and cQ (n), are conducted which are obtained from serial interfaces. The results of the tests are shown in Table 1.Table 1
NIST test results for the random sequences of the new system, Lorenz system, and Qi system (the number of sequences is 100, and their lengths are 1000000).
Statistical testP value of cL (n)P value of cQ (n)P value of c (n)Test results ofc (n)ProportionFrequency0.0000000.2368100.474986√100/100Block frequency (m = 128)0.2896670.6993130.946308√99/100Cumulative sums0.0000000.1087910.779188√100/100Runs0.0000000.5544200.075719√100/100Longest run0.4190210.3838270.289667√100/100Rank0.8513830.9963350.289667√100/100FFT0.9114130.9114130.213309√99/100Nonoverlapping template (m = 9)0.0000030.1815570.983453√100/100Overlapping template (m = 9)0.1815570.9357160.924076√100/100Universal0.6163050.2896670.014550√97/100Approximate entropy (m = 10)0.0000000.7981390.816537√99/100Random excursions0.0088790.3190840.739918√64/64Random excursions variant0.2133090.2896670.949602√64/64Linear complexity (M = 500)0.0109880.0135690.108791√99/100Serial (m = 16)0.6163050.0288170.262249√100/100As shown in Table1, all the test results for the random sequences of the new system meet the NIST test index standards. Partial test results are larger than 0.8, which means these random indexes are quite close to those of the real random sequences. The randomness indexes and some other test results are better than those generated from Lorenz system and Qi system, such as frequency, block frequency, cumulative sums, nonoverlapping template, approximate entropy, random excursions, random excursions variant, and linear complexity.


### 3.4. Statistical Analyses

Vivado IDE is used to conduct the hardware simulation. The paper also performs the statistics analysis for the encrypted video data generated by hardware. Figure6(a) is one picture of a video before encryption. Figure 6(b) is the encrypted picture of a video.Figure 6
The original and encrypted pictures of a video and the corresponding encrypted video data through FPGA. (a) The original picture of a video. (b) The encrypted picture of a video. (c) Encrypted video data shown on a monitor.
(a)(b)(c)Figure7 demonstrates the comparisons of statistics histogram between the original and encrypted pictures.Figure 7
Histogram between the original and encrypted pictures. (a) Histogram of the original picture. (b) Histogram of the encrypted picture.
(a)(b)Figure7 demonstrates the comparisons of statistics histograms between the original and encrypted pictures. As illustrated in Figure 7(a), the difference of the pixels distribution is obvious. However, distribution of different pixels for the encrypted picture shown in Figure 7(b) is the approximately uniform distribution. It can be concluded that the proposed encryption algorithm for the new system can better resist statistic attack effectively.


### 3.5. Differential Analysis

Differential attack is used to measure the sensitivity of plaintext change for the encryption algorithm and commonly uses NPCR (Number of Pixels Change Rate) and UACI (Unified Average Changing Intensity) as indexes defined as follows:(28)NPRC=∑e,fDe,fW×H×100%,UACI=1W×H×∑e,fCe,f−C′e,f255×100%,(29)NPRC¯=∑mNPRCm,UACI¯=∑mUACIm,where C (e, f) is the pixel value before encryption and C′ (e, f) is the pixel value after encryption. If C (e, f) = C′ (e, f), D (e, f) = 0, else 1. NPRC¯ and UACI¯ calculated by (29) and the proposed system and encryption algorithm are 99.60% and 12.28% for the first-time encryption, respectively. Therefore, the ability to resist differential attack improves to some extent. In video encryption application, the requirement for encryption speed is more concerned.


### 3.6. Correlation Analysis

Correlation analysis is used to check whether the neighbor pixels are close or not. This paper analyzes the correlation for Figure6. The paper selects 5000 random pixels from the original and the encrypted images and analyzes the correlation among these random-pixel pairs as shown in Figure 8. As Figure 8 illustrates, the correlation dramatically decreases when comparing two figures before and after encryption as shown in Figure 6.Figure 8
Correlation analyses for the original and encrypted figures in Figure6. (a) Correlation analysis for the original figure as shown in Figure 6(a). (b) Correlation analysis for the encrypted figure as shown in Figure 6(b).
(a)(b)


## 3.1. Discretization for the New System and Its Implementation Based on FPGA

In the hardware experiment, it is impossible to implement the continuous Lorenz and Qi chaotic systems because of limitation of the bit width in FPGA. Therefore, it is necessary to discretize continuous system first. Multiple methods can be used to discretize a differential equation such as Euler method, improved Euler method, and Runge-Kutta method. To meet the requirement of real-time performance and the limitation of hardware implementation, Euler method is used to discretize the differential equations due to its low computation complexity. First, Euler method is used to discretize Qi and Lorenz systems, respectively. The corresponding process of Qi system is proposed as follows:(15)xQ1n+1−xQ1nτ=axQ2n−xQ1n+xQ2nxQ3n,xQ2n+1−xQ2nτ=bxQ1n+xQ2n−xQ1nxQ3n,xQ3n+1−xQ3nτ=−cxQ3n−exQ4n+xQ1nxQ2n,xQ4n+1−xQ4nτ=−dxQ4n+fxQ3n+xQ1nxQ2n.Then, the iteration equations of Qi system are shown in(16)xQ1n+1=aτxQ2n+1−aτxQ1n+τxQ2nxQ3n,xQ2n+1=bτxQ1n+1+bτxQ2n−τxQ1nxQ3n,xQ3n+1=1−cτxQ3n−eτxQ4n+τxQ1nxQ2n,xQ4n+1=1−dτxQ4n+fτxQ3n+τxQ1nxQ2n.Similarly, the discrete Lorenz system is (17)xn+1−xnτ=σyn−xn,yn+1−ynτ=rxn−yn−xnznzn+1−znτ=xnyn−βzn.,Correspondingly, the iteration equations of Lorenz system are(18)xn+1=στyn+1−στxn,yn+1=rτxn+1−τyn−τxnzn,zn+1=τxnyn+1−βτzn.In general, FPGA can store float data and fixed-point data. Since fixed-point data require less computing resources than that of float data, this paper uses 64-bit fixed-point number to represent the data. The detailed data format of 64-bit fixed-point numbers is shown in Figure4.Figure. 4
Data format for 64-bit fixed-point numbers.In Figure4, I represents the integer part of 64-bit fixed-point numbers, and f is the fractional part.As mentioned before, because of the limitation of bit width in FPGA, all data are truncated numbers in hardware implementation. Therefore, the Qi and Lorenz system becomes(19)xQ1n+1=aτxQ2n+1−aτxQ1n+τxQ2nxQ3n,xQ2n+1=bτxQ1n+1+bτxQ2n−τxQ1nxQ3n,xQ3n+1=1−cτxQ3n−eτxQ4n+τxQ2nxQ1n,xQ4n+1=1−dτxQ4n+fτxQ3n+τxQ1nxQ2n,(20)xn+1=στyn+1−στxn,yn+1=rτxn+1−τyn−τxnzn,zn+1=τxnyn+1−βτzn.Let the iteration step beτ = 0.00001 and use the same parameters in system (12). Then substitute them into (19) and (20), respectively. Therefore, Qi system and Lorenz system are changed as follows:(21)xQ1n+1=0.9995xQ2n+0.0005xQ1n+0.00001xQ2nxQ3n,xQ2n+1=0.0002xQ1n+1.0002xQ2n−0.00001xQ1nxQ3n,xQ3n+1=0.99987xQ3n−0.00033xQ4n+0.00001xQ2nxQ1n,xQ4n+1=0.00008xQ4n+0.9997xQ3n+0.00001xQ1nxQ2n,(22)xn+1=0.0001yn+0.9999xn,yn+1=0.00028xn+0.99999yn−0.00001xnzn,zn+1=0.00001xnyn+0.9999733zn.To iterate Qi system and Lorenz system and make semitensor product operation on these two systems after each iteration, respectively, the discretized first 8 state variables of the new system are obtained:(23)x1n+1=xn+1×xQ1n+1,x2n+1=xn+1×xQ2n+1,x3n+1=xn+1×xQ3n+1,x4n+1=xn+1×xQ4n+1,x5n+1=yn+1×xQ1n+1,x6n+1=yn+1×xQ2n+1,x7n+1=yn+1×xQ3n+1,x8n+1=yn+1×xQ4n+1,where xi(n + 1) and xi (n) are system state variables. yn+1 is the approximate value of y (n + 1) using fixed-point number.


## 3.2. Implementation and Analysis of Encryption Algorithm of the New Chaotic System

In order to ensure the randomness of the random sequence, therefore, select the low bits fromt to q as shown in Figure 5. The positions of these bits are not close to those of sign and exponent bits. Then the chosen random encryption sequence, ci (n), is shown in equation (17). This paper selects t = 1 and q = 6:(24)cin=modxin2t−1,2q−t+1,i=1,2,…,8.Figure 5
The schematics of numbered data bits.Random sequences which are selected from eight states based on the method mentioned previously are combined to generate the random sequence,c (n):(25)cn=c1n,c2v,…,c8n.In order to resist the differential attack and decrease the correlation between adjacent random sequences, the paper selects the very first iteration sequence among everyN iterations and stacks these selected sequences to construct a random sequence, c (n), as shown in equation (18). This can improve the randomness of the random sequence.Next, the random sequence,c (n), conducts XOR operation with the divided video data. Since a frame video data includes tricolor integer sequences, R (n), G (n), and B (n), these three sequences will be encrypted simultaneously after changing the random sequence, c (n), into three columns evenly, c1 (n), c2 (n), and c3 (n):(26)p1n=c1n⊕Rn,p2n=c2n⊕Gn,p3n=c3n⊕Bn,where p1 (n), p2 (n), and p3 (n) are encrypted sequences and ⊕ is an XOR operation. One has(27)R^n=modx^1n2t,2q−t+1⊕p1n=modx^1n2t,2q−t+1⊕c1n⊕Rn,G^n=modx^2n2t,2q−t+1⊕p2n=modx^2n2t,2q−t+1⊕c1n⊕Gn,B^n=modx^3n2t,2q−t+1⊕p3n=modmodx^3n,2t,2t−q⊕c3n⊕Bn,where x^p′n,p′=1,2,3 are receiver terminal sequences.


## 3.3. Analysis for NIST Test

NIST test is provided by National Institute of Standards and Technology, and it is a standard to test the randomness of a random sequence. According to the encryption algorithm in this paper,c (n) in equation (25) should be tested by NIST standard. The comparisons of the random sequence among the new system, Qi system, and Lorenz system, c (n), cL (n), and cQ (n), are conducted which are obtained from serial interfaces. The results of the tests are shown in Table 1.Table 1
NIST test results for the random sequences of the new system, Lorenz system, and Qi system (the number of sequences is 100, and their lengths are 1000000).
Statistical testP value of cL (n)P value of cQ (n)P value of c (n)Test results ofc (n)ProportionFrequency0.0000000.2368100.474986√100/100Block frequency (m = 128)0.2896670.6993130.946308√99/100Cumulative sums0.0000000.1087910.779188√100/100Runs0.0000000.5544200.075719√100/100Longest run0.4190210.3838270.289667√100/100Rank0.8513830.9963350.289667√100/100FFT0.9114130.9114130.213309√99/100Nonoverlapping template (m = 9)0.0000030.1815570.983453√100/100Overlapping template (m = 9)0.1815570.9357160.924076√100/100Universal0.6163050.2896670.014550√97/100Approximate entropy (m = 10)0.0000000.7981390.816537√99/100Random excursions0.0088790.3190840.739918√64/64Random excursions variant0.2133090.2896670.949602√64/64Linear complexity (M = 500)0.0109880.0135690.108791√99/100Serial (m = 16)0.6163050.0288170.262249√100/100As shown in Table1, all the test results for the random sequences of the new system meet the NIST test index standards. Partial test results are larger than 0.8, which means these random indexes are quite close to those of the real random sequences. The randomness indexes and some other test results are better than those generated from Lorenz system and Qi system, such as frequency, block frequency, cumulative sums, nonoverlapping template, approximate entropy, random excursions, random excursions variant, and linear complexity.


## 3.4. Statistical Analyses

Vivado IDE is used to conduct the hardware simulation. The paper also performs the statistics analysis for the encrypted video data generated by hardware. Figure6(a) is one picture of a video before encryption. Figure 6(b) is the encrypted picture of a video.Figure 6
The original and encrypted pictures of a video and the corresponding encrypted video data through FPGA. (a) The original picture of a video. (b) The encrypted picture of a video. (c) Encrypted video data shown on a monitor.
(a)(b)(c)Figure7 demonstrates the comparisons of statistics histogram between the original and encrypted pictures.Figure 7
Histogram between the original and encrypted pictures. (a) Histogram of the original picture. (b) Histogram of the encrypted picture.
(a)(b)Figure7 demonstrates the comparisons of statistics histograms between the original and encrypted pictures. As illustrated in Figure 7(a), the difference of the pixels distribution is obvious. However, distribution of different pixels for the encrypted picture shown in Figure 7(b) is the approximately uniform distribution. It can be concluded that the proposed encryption algorithm for the new system can better resist statistic attack effectively.


## 3.5. Differential Analysis

Differential attack is used to measure the sensitivity of plaintext change for the encryption algorithm and commonly uses NPCR (Number of Pixels Change Rate) and UACI (Unified Average Changing Intensity) as indexes defined as follows:(28)NPRC=∑e,fDe,fW×H×100%,UACI=1W×H×∑e,fCe,f−C′e,f255×100%,(29)NPRC¯=∑mNPRCm,UACI¯=∑mUACIm,where C (e, f) is the pixel value before encryption and C′ (e, f) is the pixel value after encryption. If C (e, f) = C′ (e, f), D (e, f) = 0, else 1. NPRC¯ and UACI¯ calculated by (29) and the proposed system and encryption algorithm are 99.60% and 12.28% for the first-time encryption, respectively. Therefore, the ability to resist differential attack improves to some extent. In video encryption application, the requirement for encryption speed is more concerned.


## 3.6. Correlation Analysis

Correlation analysis is used to check whether the neighbor pixels are close or not. This paper analyzes the correlation for Figure6. The paper selects 5000 random pixels from the original and the encrypted images and analyzes the correlation among these random-pixel pairs as shown in Figure 8. As Figure 8 illustrates, the correlation dramatically decreases when comparing two figures before and after encryption as shown in Figure 6.Figure 8
Correlation analyses for the original and encrypted figures in Figure6. (a) Correlation analysis for the original figure as shown in Figure 6(a). (b) Correlation analysis for the encrypted figure as shown in Figure 6(b).
(a)(b)


## 4. Conclusions

This paper proposed a new chaotic system generated by using semitensor product on two chaotic systems, and the related dynamic characteristics are analyzed. The new system is employed in video encryption as well, and the proposed method can generate 8 or even 12 state variables when compared to Qi system and Lorenz system which only generate 7 state variables at most in one iteration period. The proposed method can improve the speed of random sequence generation. The NIST test results demonstrate that the pseudorandomness of new system is better than that of single Qi system and single Lorenz system.The proposed encryption algorithm based on semitensor product can be used in other chaotic systems. The synchronization of the new system can be implemented by synchronizing two original chaotic systems separately. In this paper, FPGA is used to implement the generation of the new chaotic system and to encrypt video data. The corresponding statistics and differential and correlation analyses were also conducted which demonstrates that the new system has obvious advantages, such as better random features, better resistance to differential attacks, and lower pixel correlation for encrypted images. The future work will focus on the decryption of video information by the proposed chaotic system generated by the semitensor product method in hardware.



---

*Source: 1230804-2020-07-17.xml*