Printer Friendly

Image Encryption Algorithm Based on a Novel Improper Fractional-Order Attractor and a Wavelet Function Map.

1. Introduction

With rapid development of communications, network security of information has become increasingly important for many applications. While high redundancy for image and multimedia information is challenging traditional cryptography algorithms [1,2], chaotic attractors have orbital pseudorandom properties, good unpredictability, highly sensitivity for initial conditions, topological transitivity features, and so on. These characters indicate that chaos-based cryptosystem is a research hotspot in multimedia security area [3]. In 1949, Shannon created confusion and diffusion in the world of cryptography [4]. To overcome high redundancies and strong correlations of digital images, chaos has been widely applied in traditional encryption algorithm [5-13]. Research proposed that one-dimensional chaotic system has low security [14,15]. With higher dimension, chaotic attractor occupies more space and winding complexly. The most complex attractor has much more complex output signals so that encryption effect would be better, whereas three-dimensional autonomous chaotic systems with higher fractal dimension are rare [16].

Comparing with integer-order chaotic system, the fractional-order chaotic system is not only related to parameters of the system, but also closely linked with fractional orders of system. Improper fractional-order chaotic system, therefore, has strong nonlinear characters and complexity. In secret communication, it can enhance the density and security so as to enormously increase the difficulty of unmasking signals. The algorithm shows greater application value in communication field [17,18].

The rest of this paper is organized as follows: Section 2 describes a novel complex attractor. In Section 3, the chaos-based encryption algorithm is proposed. The numerical experimental results of performance analysis are given in Section 4. Finally, Section 5 contains conclusion and perspectives.

2. Improper Fractional-Order Chaotic Flow

A new three-dimensional autonomous chaotic system with high fraction dimension is constructed, of which the governing fractional-order equation is

[mathematical expression not reproducible], (1)

where X = [(x, y, z).sup.T] are state variables and a, b, c are parameters. Three fractional orders are [q.sub.1], [q.sub.2], [q.sub.3]; if max([q.sub.1], [q.sub.2],[q.sub.3]) < 1, system (1) is a true fractional-order system, if [q.sub.1] = [q.sub.2] = [q.sub.3] = 1, system (1) is an integer-order system, and if max([q.sub.1], [q.sub.2], [q.sub.3]) > 1, system (1) is an improper fractional order system. Based on stability theory and numerical analysis of fractional-order system, when (a,b,c) = (6,5, 0.12) and ([q.sub.1],[q.sub.2],[q.sub.3]) = (1,1,1), the Lyapunov dimension [D.sub.KY] is shown in Figure 1(a) with varying parameter a in interval [1,11]. Almost all [D.sub.KY] of chaotic attractors are larger than 2.5. With increasing control parameters, [D.sub.KY] reaches as high as 2.9336 at some special parameters. As shown in Figure 1(b), the Poincare section of the maximally complex attractor has hierarchical structure composed of dense points. When ([q.sub.1],[q.sub.2],[q.sub.3]) = (1.01,1.1,1.11), the improper fractional-order chaos presents interesting and complex dynamic behavior represented in Figure 2.

3. Image Encryption Algorithm

Algorithm process is shown in Figure 3.

Encryption Procedure. Image encryption algorithm mainly consists of two processes: confusion and diffusion.

Step 1 (pixel confusion). Suppose that the size of plaintext image is L = M x N. Scanning the plaintext image line by line in order to obtain pixel matrix P is as follows:

[mathematical expression not reproducible]. (2)

In confusion procedure, the wavelet function map is taken as follows [21]:

[mathematical expression not reproducible], (3)

where n [member of] N is the number of iterations. For numerical simulations, we take the initial value of the discrete system (3) as [x.sub.0] = 0.3, parameter k = 1.33, and [mu] = -0.6. The chaotic characteristics of wavelet function map are shown in Figure 4(a), and its interesting bifurcation diagram varying with [mu] [member of] [-0.77, -0.29] is displayed in Figure 4(b).

To improve the sensitivity of original image to encryption image, secret keys are distracted by plain image. In confusion procedure, T = mod([[SIGMA].sup.L.sub.i=1] P(i), L)/(L - 1) is initial vector of wavelet function map. Sequence x(n) is rearranged by wavelet function map so as to engender position matrix lx(n). Then lx(n) is used to confuse position of image pixels and get matrix {C(i) | i = 1,2, ...,L}. Finally matrix {C(i) | i = 1,2, ...,L} is transformed into permutation image C of size M x N.

Step 2 (pixel diffusion). Confusion only changes the position of pixel point while the pixel value is fixed, so the attacker may break down the algorithm though the statistics.

In diffusion, T is used to disturb parameter a = a + T of system (1). Then the chaos generates chaotic sequences and makes [N.sub.0] times preiteration to eliminate some harmful effect of chaos transient process. Matrix B is created and initialized as an empty sequence. State vector {x(1), x(2), x(3)} is generated in every iteration and a parameter m = mod (abs(x(1) + x(2) + x(3)),3) is derived. Then, matrix B is assigned according to parameter m. When m = 0, B = {B, [x.sub.1], [x.sub.2]}, when m = 1, B = {B, [x.sub.1],[x.sub.3]}, and when m = 2, B = {B, [x.sub.3],[x.sub.1]}.

In every interaction, sequence B has strong randomness after 2L + [N.sub.0] times iteration. Then B is preprocessed in the following form:

K(i) = mod (temp, 256), i = 1,2, ...,L, (4)

where Temp = floor (([absolute value of B(i)] - floor ([absolute value of B(i)])) x [10.sup.m]), [absolute value of x] is absolution of x, and floor (x) expresses downrounding. The positive integer m = 12. The autocorrelation of sequence B focuses on the interval [-0.1,0.1] and is shown in Figure 5(a), whereas the autocorrelation of sequence K after the pretreatment focuses on a smaller interval [-0.003, 0.003] processed in Figure 5(b).

During diffusion, first pixel of permutation image C is encrypted as follows:

C(1) = [C(1) + K(1)] mod 256

[direct product] [C(L) + K(1 + L + T)] mod 256. (5a)

However, for pixel at position i > 1, pixel substitution is made according to

C(i) = [C(i) + K(i)] mod 256

[direct product][C(i - 1) + K(i + L + T)] mod 256,

i = 1,2, ...,L. (5b)

Then sequence {C(i), i = 1,2, ..., L} is conversed into matrix with size of M x N.

Decryption is inverse operation of encryption process. Decryption image D is scanned line by line to get sequence {D(i) | i = 1,2, ..., L} (L = M x N).

temp = C(i) [direct product] [C(i - 1) + K(i + L + T)] mod 256,

D(i) = [temp - K(i)] mod 256, (6a)

i = L, L - 1, ...,2,

temp = C(1)[direct product][C(L) + K(1 + L + T)] mod 256,

D(1) = [temp -K(1)] mod 256. (6b)

Then, inverse scrambling operation for matrix {D(i) | i = 1,2, ...,L} is made. Firstly, sequence x(n) is generated by wavelet function map to produce position matrix lx(n). Then lx(n) is arranged by the same law so as to get position matrix llx(n). At last we use llx(n) to confuse pixel position of image D to get matrix {E(i) | i = 1,2, ...,L} and change matrix E into M x N two-dimension matrix to observe final decrypted image.

4. Numerical Simulation and Performance Analysis

The proposed encryption technique is implemented in MATLAB 7.1. In the experiment, different types of digital images are tested, such as gray image, binary image, and color image.

4.1. 3D Histogram Analysis. Histogram is a graphical representation of the pixels intensity distribution of an image, and it can measure the capacity of resisting attack. The gray Lena image of size 256 x 256 is encrypted as shown in Figure 6(c) and the 3D histogram of the encrypted Lena image is shown in Figure 6(d). The binary image has only two colors and is sensitive to the change of pixel. 3D histograms of a binary image are encrypted and encrypted binary images are demonstrated in Figures 7(b) and 7(d), respectively. Figure 8(a) shows the color image and its RGB histograms; Figure 8(b) shows the encrypted color image of Figure 8(a) and its RGB histograms. The histogram of the encrypted image is fairly uniform and significantly different from that of the original image, so the information is unpredictable and histogram attack can be avoided.

4.2. Information Entropy. Information entropy, firstly proposed by Shannon in 1949, is a significant property that reflects the randomness and the unpredictability of an information source [4]. With bigger entropy image has more uniform gray distribution. The entropy H(x) is defined by the following formula: H(x) = -[[SIGMA].sup.n.sub.i=1] p([x.sub.i])[log.sub.2] p([x.sub.i]) where p([x.sub.i]) denotes the probability of symbol [x.sub.i]. When p([x.sub.i]) = 1/256, the 256 x 256 gray image has maximum entropy of 8. Entropy of gray Lena image and binary image is 7.447144 and 0.593165, respectively, while its encryption is 7.988847 and 7.972069, respectively. Considering RGB components of color image Lena, average information entropy of the color Lena and encrypted color Lena is 7.198813 and 7.997281, respectively. It is obvious that the entropies of the cipher images are very close to the theoretical value of 8, which means that the encryption algorithm has ability of resisting statistical attack.

4.3. Correlation Coefficients of Adjacent Pixels. In the section, we aim at checking up the correlation of two adjacent pixels between the original image and encrypted image. In this simulation, randomly selected 1000 pairs of adjacent pixels (horizontally, vertically, and diagonally) are determined. The correlation coefficient between two adjacent pixels in an image is determined according to the following formula:

[R.sub.xy] = Conv(x,y)/[square root of (D(x))][square root of (D(y))], (7)


[mathematical expression not reproducible]. (8)

Figure 9 displays correlation coefficients of adjacent pixels in four directions of Lena plain image and cipher image. The result emphasizes that there is hardly any correlation of adjacent pixels in encryption images. Correlation coefficients of the encrypted Lena image are smaller than other methods shown in Table 1. The statistical properties of original image have randomly spread to encryption image.

4.4. Resistance to Differential Attack. The attacker may observe the change of decryption by the tiny change of plaintext to find the correlation between plain image and cipher image. Based on principles of cryptology, a good encryption algorithm should be sensitive to plaintext sufficiently. In general, attacker makes a slight change (e.g., modify only one pixel) for plaintext to find out some relationships between plain image and encrypted image. If tiny change of original image can bring great changes to cipher image, the effect of differential attack will be reduced. Sensitivity of the plaintext encryption algorithm can be quantified by NPCR (number of pixels changing rate) and UACI (unified average changing intensity). They are defined as follows:

[mathematical expression not reproducible], (9)

where [C.sub.1](i, j) and [C.sub.2](i, j) indicate pixel value of two encryption images at location (i, j). M and N present number of rows and columns of the original image.

The ideal expectations of NPCR and UACI can be calculated by the following simplified formulas:

[mathematical expression not reproducible], (10)

where n is the number of bits used to represent the different bit planes of an image. For gray scale image parameter n = 8 (8 bits per pixel). Hence expected NPCR and expected UACI are [NPCR.sub.E] = 99.6094% (horizontal solid line in Figure 10(a)) and [UACI.sub.E] = 33.4635% (horizontal solid line in Figure 10(b)), respectively. From the above formula we can see that relation [NPCR.sub.E] + [3UACI.sub.E] = 2, so any value of the ideal expectations can illustrate the capability of algorithm to attack resisting plaintext.

In this experiment, one hundred groups of Lena images are encrypted. In every group image, one is original image and the other is original image with only one changed pixel value (including border points and intermediate points, each time the changed amount is only 1). Then the test results are shown in Figure 10; every value fluctuates up and down near ideal value. The average values are [bar.NPCR] = 99.6091% (horizontal dotted line in Figure 10(a)) and [bar.UACI] = 33.5038% (horizontal dotted line in Figure 10(b)), respectively. Obviously the given encryption algorithm greatly improves the ensitivity of plaintext, thereby enhancing capacity of resistance to differential attacks.

4.5. Key Sensitivity Test. Lena gray image is used to make experimental analysis. With right key, the decrypted image is clear and correct without any distortion in Figure 11(a). Decryption using keys with slight mismatch is performed so as to evaluate the key sensitivity. With a subtle change, the new key [q.sub.1] = 1.01000000001, and the decrypted image is incorrect, proposed in Figure 11(b). Subtle change of key yields greatly different decrypted images. It is fully convincing that the algorithm has steady and superior secure performance in the first encryption round and will well resist differential attack.

4.6. Algorithmic Complexity Analyses. The time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity is commonly described using the big-O notation, which suppresses multiplicative constants and lower order terms. Time complexity of generating key is O(M x N). The maximum complexity chaos and wavelet function map generate chaos sequences with time complexities O([T.sup.2.sub.1]) and O([T.sup.2.sub.2]), respectively. Pixel diffusion and substitution have the same time complexity O(M x N). At each step, the worst total time complexity is

O(M x N) + O([T.sup.2.sub.1]) + O([T.sup.2.sub.2]) + O(M x N)

= O(T), (11)

where T = max{M x N, [T.sup.2.sub.1], [T.sup.2.sub.2]}. [T.sub.1] and [T.sub.2] represent iterate numbers of maximum complexity chaos and wavelet function map, respectively.

5. Conclusion

This paper presents a novel fractional-order complex attractor with high fraction dimension, and the preprocessed chaotic sequence has good random character. Secret key is disturbed by every order and pixel value of plaintext; thus slight change of plaintext can bring vast differentness in encrypted image. Theoretical analysis and experimental results indicate that the encryption algorithm has some good characters, such as resistance for different attack, better information entropy, and low coefficient correlation. Comparing with some chaos-based algorithms, the estimated results demonstrate the strong capabilities and the effectiveness of the proposed algorithm. The time complexity of the algorithm is proposed and an example is investigated to verify its validity and practicability. Our future works will focus on video encryption using fractional-order chaotic system.

Conflicts of Interest

The authors declare that they have no competing interests.


This research is supported by NNSFs of China (Grant no. 11501525), Science & Technology Innovation Talents in Universities of Henan Province (Grant no. 16HASTIT040), Teacher Education Curriculum Reform of Henan Province (Grant no. 2017-JSJYYB-190), Project of Youth Backbone Teachers of College and Universities in Henan Province (Grant nos. 2013GGJS-142 and 2015GGJS-179), and Basic & Advanced Technological Research Project of Henan Province (Grant no. 162300410261).


[1] B. Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C, John Wiley & Sons, New York, NY, USA, 2nd edition, 1996.

[2] J. Daemen and V. Rijmen, The Design of Rijndael: AES-The Advanced Encryption Standard, Springer, Berlin, Germany, 2002.

[3] L. Kocarev, G. Jakimoski, T. Stojanovski, and U. Parlitz, "From chaotic maps to encryption schemes," in Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS '98), pp. 514-517, IEEE, Monterey, Calif, USA, June 1998.

[4] C. E. Shannon, "Communication theory of secrecy systems," The Bell System Technical Journal, vol. 28, no. 4, pp. 656-715, 1949.

[5] N. K. Pareek, V. Patidar, and K. K. Sud, "Discrete chaotic cryptography using external key," Physics Letters. A, vol. 309, no. 1-2, pp. 75-82, 2003.

[6] X. Wang and L. Teng, "An image blocks encryption algorithm based on spatiotemporal chaos," Nonlinear Dynamics. An International Journal of Nonlinear Dynamics and Chaos in Engineering Systems, vol. 67, no. 1, pp. 365-371, 2012.

[7] 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.

[8] D. Xiao, X. Liao, and P. Wei, "Analysis and improvement of a chaos-based image encryption algorithm," Chaos, Solitons & Fractals, vol. 40, no. 5, pp. 2191-2199, 2009.

[9] X.-Y. Wang and X.-M. Bao, "A novel block cryptosystem based on the coupled chaotic map lattice," Nonlinear Dynamics, vol. 72, no. 4, pp. 707-715, 2013.

[10] G. Jakimoski and L. C. Kocarev, "Analysis of some recently proposed chaos-based encryption algorithms," Physics Letters. A, vol. 291, no. 6, pp. 381-384, 2001.

[11] 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.

[12] O. Mirzaei, M. Yaghoobi, and H. Irani, "A new image encryption method: parallel sub-image encryption with hyper chaos," Nonlinear Dynamics, vol. 67, no. 1, pp. 557-566, 2012.

[13] Y. Wang, K.-W. Wong, X. F. Liao, and G. R. Chen, "A new chaos-based fast image encryption algorithm," Applied Soft Computing, vol. 11, no. 1, pp. 514-522, 2011.

[14] A. I. Ismail, A. Mohammed, and D. Hossam, "A digital image encryption algorithm based a composition of two chaotic Wavelet function map," International Journal of Network Security, vol. 11, no. 1, pp. 1-10, 2010.

[15] R. Rhouma and S. Belghith, "Cryptanalysis of a new image encryption algorithm based on hyper-chaos," Physics Letters, Section A: General, Atomic and Solid State Physics, vol. 372, no. 38, pp. 5973-5978, 2008.

[16] X.-F. Li, K. E. Chlouverakis, and D.-L. Xu, "Nonlinear dynamics and circuit realization of a new chaotic flow: a variant of Lorenz, Chen and Lu," Nonlinear Analysis. Real World Applications. An International Multidisciplinary Journal, vol. 10, no. 4, pp. 2357-2368, 2009.

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

[18] X. Wu, H. Wang, and H. Lu, "Modified generalized projective synchronization of a new fractional-order hyperchaotic system and its application to secure communication," Nonlinear Analysis. Real World Applications, vol. 13, no. 3, pp. 1441-1450, 2012.

[19] O. Mannai, R. Bechikh, H. Hermassi, R. Rhouma, and S. Belghith, "A new image encryption scheme based on a simple first-order time-delay system with appropriate nonlinearity," Nonlinear Dynamics, vol. 82, no. 1-2, pp. 107-117, 2015.

[20] Q. Liu, P.-Y. Li, M.-C. Zhang, Y.-X. Sui, and H.-J. Yang, "A novel image encryption algorithm based on chaos maps with Markov properties," Communications in Nonlinear Science and Numerical Simulation, vol. 20, no. 2, pp. 506-515, 2015.

[21] W.-B. Yu and X.-P. Wei, "Bifurcation diagram of a wavelet function," Acta Physica Sinica, vol. 55, no. 8, pp. 3969-3973, 2006.

Jian-feng Zhao, (1) Shu-ying Wang, (2) Li-tao Zhang, (3) and Xiao-yan Wang (1)

(1) Department of Information Engineering, Henan Polytechnic, Zhengzhou, China

(2) Department of Minzu, Huanghe Science and Technology College, Zhengzhou, China

(3) Department of Mathematics and Physics, Zhengzhou Institute of Aeronautical Industry Management, Zhengzhou 450015, China

Correspondence should be addressed to Shu-ying Wang;

Received 12 November 2016; Revised 21 January 2017; Accepted 8 February 2017; Published 22 March 2017

Academic Editor: Jucheng Yang

Caption: Figure 1: Chaotic characters of the novel attractor with [q.sub.l] = [q.sub.2] = [q.sub.3] = 1.

Caption: Figure 2: The fractional-order chaos with [q.sub.l] = 1.01, [q.sub.2] = 1.1, and [q.sub.3] = 1.11.

Caption: Figure 3: Encryption process.

Caption: Figure 4: Wavelet function map.

Caption: Figure 5: Autocorrelation of sequences.

Caption: Figure 6: The gray Lena image.

Caption: Figure 7: The binary image.

Caption: Figure 8: The color parrot image: (a) the plain image and its RGB histograms; (b) the encrypted image and its RGB histograms.

Caption: Figure 9: Correlation coefficients of original and encryption image: horizontal; vertical; diagonal; counterdiagonal.

Caption: Figure 10: Measured sensitivity of cipher image to plain image.

Caption: Figure 11: The decrypted Lena image.
Table 1: Correlation coefficient of different plain image and cipher

Plain image                    Horizontal

Gray Lena Plain image           0.972953
  Encrypted image        -4.097226 x [10.sup.-5]
  Encrypted image [19]          0.000417
  Encrypted image [20]            0.023

Binary image
  Plain image                   0.915352
  Encrypted image        -3.811868 x [10.sup.-6]

Color parrot
    Plain image                 0.945140
    Encrypted image             -0.001678
    Plain image                 0.948746
    Encrypted image      -8.326210 x [10.sup.-4]
    Plain image                 0.956960
    Encrypted image      -7.902728 x [10.sup.-6]

Plain image                     Vertical

Gray Lena Plain image           0.970462
  Encrypted image        1.158832 x [10.sup.-4]
  Encrypted image [19]          -0.002048
  Encrypted image [20]            0.028

Binary image
  Plain image                  0.922622291
  Encrypted image        -7.131676 x [10.sup.-4]

Color parrot
    Plain image                 0.950725
    Encrypted image      3.514572 x [10.sup.-4]
    Plain image                 0.941403
    Encrypted image      -4.626904 x [10.sup.-5]
    Plain image                 0.924891
    Encrypted image      1.1520873 x [10.sup.-4]

Plain image                     Diagonal

Gray Lena Plain image           0.916925
  Encrypted image        4.620716 x [10.sup.-5]
  Encrypted image [19]          -0.001554
  Encrypted image [20]            0.023

Binary image
  Plain image                   0.868221
  Encrypted image        -9.372164 x [10.sup.-4]

Color parrot
    Plain image                 0.919702
    Encrypted image      -9.329940 x [10.sup.-4]
    Plain image                 0.910118
    Encrypted image      1.484844 x [10.sup.-5]
    Plain image                 0.924891
    Encrypted image       9.66501 x [10.sup.-4]

Plain image                  Counterdiagonal

Gray Lena Plain image           0.938441
  Encrypted image        4.539076 x [10.sup.-4]
  Encrypted image [19]
  Encrypted image [20]

Binary image
  Plain image                   0.857255
  Encrypted image        -3.496642 x [10.sup.-4]

Color parrot
    Plain image                 0.937272
    Encrypted image      -4.626904 x [10.sup.-5]
    Plain image                 0.929873
    Encrypted image      6.479456 x [10.sup.-4]
    Plain image                 0.941023
    Encrypted image      -1.766560 x [10.sup.-4]
COPYRIGHT 2017 Hindawi Limited
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2017 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Title Annotation:Research Article
Author:Zhao, Jian-Feng; Wang, Shu-Ying; Zhang, Li-Tao; Wang, Xiao-Yan
Publication:Journal of Electrical and Computer Engineering
Date:Jan 1, 2017
Previous Article:Self-Tuning Control Scheme Based on the Robustness [sigma]-Modification Approach.
Next Article:Reordering Features with Weights Fusion in Multiclass and Multiple-Kernel Speech Emotion Recognition.

Terms of use | Privacy policy | Copyright © 2022 Farlex, Inc. | Feedback | For webmasters |