Journal of Electrical and Computer Engineering
Volume 2019 (2019), Article ID 4505969, 7 pages
https://doi.org/10.1155/2019/4505969

Research Article

Cartoon Image Encryption Algorithm by a Fractional-Order Memristive Hyperchaos

Shu-ying Wang,¹ Jian-feng Zhao,² Xiao-yan Wang,² and Li-tao Zhang³

¹Huanghe Science and Technology College, Zhengzhou, China
²College of Information Engineering, Henan Polytechnic, Zhengzhou, China
³College of Science, Zhengzhou University of Aeronautics, Zhengzhou 450015, China

Correspondence should be addressed to Shu-ying Wang; wsy0707@126.com

Received 9 August 2018; Accepted 27 November 2018; Published 3 March 2019

Academic Editor: Jar Ferr Yang

Copyright © 2019 Shu-ying Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

Based on the Adomian decomposition method and Lyapunov stability theory, this paper constructs a fractional-order memristive hyperchaos. Then, the 0–1 test analysis is applied to detect random nature of chaotic sequences exhibited by the fractional-order systems. Comparing with the corresponding integer-order hyperchaotic system, the fractional-order hyperchaos possesses higher complexity. Finally, an image encryption algorithm is proposed based on the fractional-order memristive hyperchaos. Security and performance analysis indicates that the proposed chaos-based image encryption algorithm is highly resistant to statistical attacks.

1. Introduction

With the rapid development of Internet and information technology, multimedia become an important mode of interaction. The widespread use of digital image, making the security problem of image data become more and more prominent, the research on digital image security is of great theoretical value and practical significance. Chaotic systems are extremely sensitive to initial conditions, the orbital unpredictability, and the internal randomness [1–3]. Therefore, it becomes one of the key research objects of modern cryptography to introduce chaos theory into the field of image security [4–6].

Memristor is a kind of resistance and in possession of the function of memory. Since 2008, memristor has obtained people’s close concern, which played an active promoting role in the development of circuit and system theory [7, 8]. Chaotic systems designed by memristor have complex dynamic characters, and thus they have wide application prospect in secure communication and image encryption [9–14].

The rest of this paper is organized as follows: the fractional-order memristive hyperchaotic system is presented in Section 2. The memristive hyperchaotic system shows complicate nonlinear dynamics behavior, and therefore it is difficult to predict trajectories. The proposed image encryption algorithm is described in Section 3. Block permutation and diffusion strategy of plain text processing are used in order to enhance the security of the encryption algorithm. In Section 4, different kinds of images are encrypted as examples by using the designed algorithm, and numerical experiment results are investigated. It is robust against chosen/known plain image attack with just one permutation-diffusion round. Finally, the conclusions are drawn in Section 5.

2. Memristive Hyperchaos

Memristive chaos circuit can create a new signal generator, and therefore, it becomes a new research field. A memristive hyperchaos [15] is proposed as follows:

where is the coefficient related with memristor , are the state variables, are the intrinsic parameters, and are the Caputo derivatives of fractional order. It is interesting that system (1) has an infinite set of equilibria, including infinite stable equilibria and unstable equilibria, so it shows more plentiful dynamic behaviors.

The Adomian decomposition algorithm needs less computation time as well as memory resources, but it yields more accurate results. When solving the integer-order differential system, it is even more accurate than the Runge–Kutta algorithm. Thus, the Adomian decomposition algorithm is adopted in this paper to analyze fractional-order memristive hyperchaos and generate hyperchaotic sequences. Based on the conformable Adomian decomposition method [16], analytical solution of system (1) is expressed with seven terms by the formula

The initial conditions are assumed as . We select , , thus is obtained. In order to obtain other corresponding coefficients, according to fractional calculus property and the nonlinear term decomposition formula, the coefficients of the other five terms can be deduced, respectively,

where , , , and .

Now, consider the case of the derivational fractional orders and parameters in system (1). And also, take initial conditions as . As shown in Figure 1, the fractional-order memristive hyperchaos has richful dynamic evolution behaviors.

(a)

(b)

Figure 1: Fractional-order chaotic attractor: (a) (x₁-x₂-x₃) plane; (b) (x₁-x₂-x₄) plane.

Then, the “0–1 test” of fractional-order memristive hyperchaos is conducted by the translation components shown in Figure 2, where and are determined by observation data, which means that they are independent of original data and system dimension. Considering sequence obtained from fractional-order memristive hyperchaos, numerical simulation displays unbounded trajectory similar to Brownian motion, which shows that the fractional-order memristive hyperchaos has rich dynamic characteristics. The 0–1 test provides a theoretical and experimental basis for application of fractional-order hyperchaos in information security and secure communication.

Figure 2: 0–1 test of improper fractional-order memristive hyperchaos.

3. Proposed Image Encryption

This section presents the image encryption scheme in the framework of symmetric key cipher architecture. For simplicity, we employ gray-scale images with the size of . Based on fractional-order memristive hyperchaos, the proposed encryption algorithm is used for gray image, color image, and binary image. Our algorithm is based on fully layered encryption technique to provide better security. We perform color transformation to separate the RGB color in its component matrix.

The fractional-order memristive chaotic system is converted into four one-dimensional chaotic sequences. To eliminate some harmful effect of chaos transient process, we make one thousand times interaction in advance. It is necessary to make the following pretreatment for chaotic sequences:

Suppose that the positive integer . As shown in Figure 3, a vast majority of sequence fluctuate around zero and locate in the interval [−0.003, 0.003], which indicates that the sequence has a high degree of randomness.

Figure 3: Self-correlations of sequence .

Divide plain image into sections . Pixel value substitution is made according to the following encryption equation:

where . Then, the encrypted sequence is translated into two-dimensional matrix, and the encrypted image is . Decryption is the inverse process of encryption.

4. Simulation Results and Security Analysis

An encryption algorithm should be robust against any statistical attacks. In this section, the results and security of encryption performance are evaluated by the histogram, the information entropy, and the correlation of two adjacent pixels in the encrypted.

4.1. Histogram Analysis

Histogram analysis of plain image and encrypted image has been performed to validate the algorithm. When some data of plain image or histogram are captured, the statistical attack will be very effective and highly performed. Figures 4(b), 5(b), and 6(b) illustrate the histograms of cartoon images “Snow White” (Figure 4(a)), “Mickey Mouse” (Figure 5(a)), and “Binary image” (Figure 6(a)). Histograms of their encrypted images are flat as shown in Figures 4(f)–4(h), 5(d), and 6(d), respectively. It is noticeable that the designed algorithm results in uniform distributions of cipher images, which can resist cipher-only attack.

(a)

(b)

(c)

(d)

(e)

(f)

(g)

(h)

Figure 4: Histogram of color Snow White image and its encrypted image: (a) plain image; (b) histogram of red component of plain image; (c) histogram of green component of plain image; (d) histogram of blue component of plain image; (e) encrypted image; (f) histogram of red component of encrypted image; (g) histogram of green component of encrypted image; (h) histogram of blue component of encrypted image.

(a)

(b)

(c)

(d)

Figure 5: Histogram of triangle gray Mickey Mouse image and its encrypted image: (a) Mickey Mouse image; (b) histogram of (a); (c) encrypted image; (d) histogram of (c).

(a)

(b)

(c)

(d)

Figure 6: Histogram of binary image and its encrypted image: (a) binary image; (b) histogram of (a); (c) encrypted image; (d) histogram of (c).

4.2. Correlation Coefficient Analysis

In simulation, we randomly select four thousand pixel pairs of horizontal, vertical, diagonal, and counterdiagonal adjacent positions in each direction from plain images and their corresponding cipher images, respectively. To test correlation coefficients of adjacent pixels between the plain images and encrypted images, correlation coefficients are determined by the following formula:

where

For the gray Mickey image, distributions of four directions are shown with different markers in Figure 7. The numeric representations of correlation coefficients are calculated and listed in Table 1. The correlation coefficients in plain images are all greater than 0.9, but they are smaller than 0.05 in corresponding encrypted images. Table 1 indicates that the performance of the proposed algorithm is better. Therefore, the proposed encryption algorithm dramatically randomized the pixels.

Figure 7: Correlation coefficients of plain and encrypted rectangle image Snow White.

Table 1: Correlation coefficients of plain image and encrypted image.

Image
Horizontal (0°)
Vertical (90°)
Diagonal (135°)
Counterdiagonal (45°)
Information entropies

Color image (Snow White)
R
Plain image
0.956870
0.969474
0.928532
0.920907
7.403101

Encrypted image
0.062626
0.058355
0.043477
0.044810
7.701237

G
Plain image
0.944415
0.960116
0.911802
0.902076
6.975635

Encrypted image
0.068252
0.082912
0.049494
0.067867
7.719597

B
Plain image
0.918471
0.943933
0.849832
0.902076
7.395466

Encrypted image
0.048840
0.046259
0.048311
0.051689
7.677057

Gray image (Mickey Mouse)
Plain image
0.962524
0.963978
0.935959
0.942013
4.079404

Encrypted image
7.503378 × 10⁻⁴
3.060559 × 10⁻⁴
3.191240 × 10⁻⁴
8.427805 × 10⁻⁵
7.990418

Binary image
Plain image
0.943381
0.965594
0.923663
0.926494
0.661291

Encrypted image
−4.794829 × 10⁻⁶
1.172771 × 10⁻⁴
−7.071503 × 10⁻⁴
0.002179
7.988849

4.3. Information Entropy Analysis

The conception of “information entropy” is proposed by Shannon. Information entropy is expressed by , where represents probability of symbol . In addition, and . Information entropy is the whole average uncertainty and statistical properties of overall information sources. Suppose that the source emits symbols with equal probability, we obtain the largest entropy . Information entropies of various encrypted images are listed in Table 1, which are close to the theoretical value 8. This means that information leakage in the encryption process is negligible, and the encryption system is secure against entropy attack.

5. Conclusion

In this study, the Adomian decomposition method is adopted to solve fractional-order memristive hyperchaos. Rich dynamic characteristics of the conformable fractional-order hyperchaotic system are shown by using the 0–1 test. A novel scheme for image encryption of digital images is proposed based on the hyperchaotic system, and it has been validated for color image, gray image, binary image, and so on. Numerical simulations demonstrate that the designed scheme not only maintains the larger secret space but also has better cryptographic performances. The algorithm is analyzed by encrypted image, histogram, correlation coefficients, and so on, therefore effectively ensuring a secure image communication. Effectiveness of the proposed algorithm is fully evaluated by numerical experiments of histogram, correlation coefficients, and information entropy.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This research was supported by the Key Scientific Research Projects in Henan Colleges and Universities (18B520022); Research Project on Education and Teaching Reform of Henan Polytechnic (2017J012); Comprehensive Management Office & Federation of Social Science Circles in Henan Province (217); Teacher Education Curriculum Reform of Henan Province (Grant no. 2017-JSJYYB-190); Science and Technique Foundation of Henan Polytechnic (2017-HZK-08); Excellent Youth Foundation of Science & Technology Innovation of Henan Province (184100510004); and Aeronautical Science Foundation of China (2017ZD55014).

References

G. Chen, Y. Mao, and C. K. Chui, “A symmetric image encryption scheme based on 3D chaotic cat maps,” Chaos, Solitons & Fractals, vol. 21, no. 3, pp. 749–761, 2004.

G. Alvarez and S. Li, “Some basic cryptographic requirements for chaos-based cryptosystems,” International Journal of Bifurcation and Chaos, vol. 16, no. 8, pp. 212–2151, 2006.

X.-F. Li, Y.-D. Chu, A. Y. T. Leung, and H. Zhang, “Synchronization of uncertain chaotic systems via complete-adaptive-impulsive controls,” Chaos, Solitons & Fractals, vol. 100, pp. 24–30, 2017.

S. Behnia, A. Akhshani, H. Mahmodi, and A. Akhavan, “A novel algorithm for image encryption based on mixture of chaotic maps,” Chaos, Solitons & Fractals, vol. 35, no. 2, pp. 408–419, 2008.

G. Ye and K.-W. Wong, “An image encryption scheme based on time-delay and hyperchaotic system,” Nonlinear Dynamics, vol. 71, no. 1-2, pp. 259–267, 2012.

J. Zhao, S. Wang, Y. Chang, and X. Li, “A novel image encryption scheme based on an improper fractional-order chaotic system,” Nonlinear Dynamics, vol. 80, no. 4, pp. 1721–1729, 2015.

L. Chua, “Memristor-The missing circuit element,” IEEE Transactions on Circuit Theory, vol. 18, no. 5, pp. 507–519, 1971.

D. B. Strukov, G. S. Snider, D. R. Stewart, and R. S. Williams, “The missing memristor found,” Nature, vol. 453, no. 5, pp. 80–83, 2008.

M. Itoh and L. O. Chua, “Memristor oscillators,” International Journal of Bifurcation and Chaos, vol. 18, no. 11, pp. 3183–3206, 2008.

B. Muthuswamy and P. Kokate, “Memristor-based chaotic circuits,” IETE Technical Review, vol. 26, no. 6, pp. 417–429, 2009.

B. C. Bao, Z. Liu, and J. P. Xu, “Steady periodic memristor oscillator with transient chaotic behaviours,” Electronics Letters, vol. 46, no. 3, pp. 228–230, 2010.

J. Mou, K. Sun, J. Ruan, and S. He, “A nonlinear circuit with two memcapacitors,” Nonlinear Dynamics, vol. 86, no. 3, pp. 1735–1744, 2016.

J. Sun, Y. Shen, Q. Yin, and C. J. Xu, “Compound synchronization of four memristor chaotic oscillator systems and secure communication,” Chaos, vol. 23, no. 1, pp. 821–12, 2013.

J. Sun and Y. Shen, “Compound-combination anti-synchronization of five simplest memristor chaotic systems,” Optik-International Journal for Light and Electron Optics, vol. 127, no. 20, pp. 9192–9200, 2016.

J. Y. Ruan, K. H. Sun, and J. Mou, “Memristor-based Lorenz hyper-chaotic system and its circuit implementation,” Acta Physica Sinica, vol. 65, no. 19, p. 190502, 2016.

S. B. He, K. H. Sun, X. Y. Mei, and S. W. Xu, “Numerical analysis of a fractional-order chaotic system based on conformable fractional-order derivative,” European Physical Journal Plus, vol. 132, no. 1, p. 36, 2017.