# A Novel Image Encryption Scheme Based on PWLCM and Standard Map

Authors: Yucheng Chen; Chunming Tang; Zongxiang Yi
Journal: Complexity
 (2020)

---

## Abstract

In the past decades, considerable attention has been paid to the chaos-based image encryption schemes owing to their characteristics such as extreme sensitivity to initial conditions and parameters, pseudo-randomness, and unpredictability. However, some schemes have been proven to be insecure due to using a single chaotic system. To increase the security, this work proposes a novel image encryption scheme based on the piecewise linear chaotic map (PWLCM) and the standard map. To the best of our knowledge, it is the first chaos-based image encryption scheme combining the PWLCM with the standard map, which adopts permutation-diffusion structure. Unlike the traditional scrambling way, a hierarchical diffusion strategy, which not only changes the pixel position but also modifies the value, is employed in the permutation phase. The operation model of row-by-row and column-by-column is further used to enhance the efficiency in the diffusion process. Consequently, a good trade-off efficiency and security can be achieved. Furthermore, the numerical simulations and performance analyses illustrate that the proposed encryption scheme can be used in practical application scenarios requiring lightweight security.


---

## Body

## 1. Introduction

With the rapid development of information technologies, the multimedia security has become more important than ever before. Image, as a special multimedia form, is becoming more popular in our daily life because of its intrinsic properties such as more intuitive and vivid than text. However, it would bring privacy problems when it is transmitted in an insecure channel. Therefore, it is very urgent to protect the privacy of image. The encryption scheme is one of the methods to protect the image, which transforms the essential contents of a plain image into a noise-like encrypted image. In the past decades, considerable attention has been paid to design chaos-based image encryption schemes since the chaotic map has many excellent characteristics such as extreme sensitivity to initial conditions and parameters and unpredictability of behavior [1]. Many chaos-based image encryption schemes have been proposed by the researchers working in the field of nonlinear dynamic and information security [2, 3].In 1998, Fridrich constructed the first image encryption scheme based the discretized Baker map using permutation-diffusion structure [4]. However, it was found that the encryption scheme can be broken with chosen encrypted image attack [5, 6]. To improve Fridrich’s work, numerous chaos-based encryption schemes have been proposed.In particular, the piecewise linear chaotic map (PWLCM), which is efficient to implement in hardware, was used in the encryption schemes presented in [7–12]. Peng et al. designed an image encryption scheme based on PWLCM [7] in 2008, which adopts a modulo addition operation to encrypt plain image with the pseudo-random sequence generated by PWLCM. Although it may be easy to implement, the security level is low because of its too simple structure. In 2011, Abdlrudha et al. utilized a nested PWLCM to encrypt plain image based on permutation-diffusion architecture [8]. The proposed image encryption scheme can achieve both low complexity and high level security performance. Later in 2012, Liu et al. described an image encryption scheme with DNA complimentary and chaotic maps [9]. The PWLCM was used to generate the pseudo-random sequences in the row and column scrambling phase. Similarly, Wang et al. also used the sequence generated by PWLCM to encrypt permuted image in diffusion process [10, 11]. In 2020, Patro et al. [12] used a cross-coupled PWLCM system to encrypt plain image, which aims to obtain a higher security than using simple chaotic map.While the one-dimensional chaotic system has low implementation complexity, the multidimensional chaotic system possess more complex behavior [13]. Specifically, the two-dimensional standard map has larger number of control parameters than the one-dimensional PWLCM, which is the reason for designers choosing it. In 2009, Patidar et al. proposed a permutation-diffusion-based image encryption scheme with the standard chaotic system and the logistic map [14]. In 2011, Patidar et al. further proposed an improved image encryption scheme based on the standard map [15]. The operation model of row-by-row and column-by-column was adopted to preliminary permutation, substitution, and main permutation for increasing the speed of the encryption process. Zhang et al. employed the standard map to scramble the pixels of two plain images [16] in 2013. In 2018, Chen et al. proposed an optical hyperspectral image encryption scheme with the standard map and the gyrator transform [17]. The pixels of plain image were scrambled according to the position sequence generated by the improved standard map. Unlike the most common permutation-diffusion architecture, Chen et al. [18] in 2019 suggested a substitution mechanism in the permutation phase via a chaos-based bit-level shuffling method. Thus, the same security level can be obtained in fewer encryption rounds.Recently, Ye et al. in 2017 proposed a spatial image encryption scheme based on chaotic map and pixel frequency [19]. The authors creatively designed a weight factor related to the pixel frequency, which aims to produce key streams associated with the plain image and thus resists the chosen plain image attack. However, one can easily test its weak position sensitivity using the given definition formula. Let plain image P be all zeros except for 1 in one position; its pixel frequency value would be the same if we move 1 to another position. Specifically, the pixel frequency is identical to the previous one due to the fact that the pixel value and its frequency are unchanged before and after moving position. This may give a chance to the attacker breaking their proposed encryption scheme under the condition of round reduced. Moreover, Patro et al. [20] and Samiullah et al. [21] in 2020 presented a plain image-related encryption scheme by using hash function. As a result, for two different plain images, even a bit of difference would have two different hash values. This means that the hash value should be secretly and timely stored and transmitted to the receiver when performing the real-time decryption process. Namely, for an image database having thousands of images, an equal number of hash values must be generated and securely stored and timely transmitted. This would make the proposed scheme impractical for such a real-time application scenario. In fact, how to securely and timely store and transmit secret key is not easy to process in real world. Besides, setting hash value as part of the secret key against, to some extent, Kerckhoffs’ principle, which requires the security of the encryption scheme, completely depends on the secret key [22]. Actually, the encryption and decryption keys should be independent of the plain image in a symmetry encryption scheme. Indeed, many schemes cannot achieve the claimed high security and are impractical for the special application scenario due to the facts pointed in [23–25]. For instance, the encryption scheme presented in [26] was proposed by Wu et al. in 2018, which adopted the deoxyribonucleic acid (DNA) approach to diffuse image and used a two-dimensional Hénon-Sine map- (2D-HSM-) based permutation. Unfortunately, their proposal was broken by the chosen plain image attack in 2020 [27].Therefore, constructing an encryption scheme which achieves a good trade-off between security and efficiency would be a hard work [28]. Nevertheless, combining the aforementioned analysis, we tentatively propose a novel image encryption scheme based on the PWLCM and the standard map in this study. It is constructed for application scenarios that require lightweight security. Firstly, an external secret key of 256-bit is employed to generate initial states and parameters of the chaotic maps. Then, the permutation-diffusion structure is adopted to encrypt plain image. Different from the pixel-by-pixel way in the permutation process, we perform a bit-level circularly shift operation on the pixels of plain image according to the pseudo-random sequence generated by the PWLCM. Thus, the position and value of the pixel can change simultaneously to enhance the encryption scheme’s security. Moreover, the discretized standard map-based permutation method is further employed to improve the security level of the proposed encryption scheme due to its structure of the resembled Feistel network. To help offset efficiency, the operation model of row-by-row and column-by-column is utilized in the diffusion phase to speed up the encryption performance. Furthermore, combining the PWLCM with the standard map, the cryptanalysis complexity of the proposed encryption scheme, which means adding slightly the number of arithmetic operation, will be bigger than only using single chaotic map. Thus, the cryptanalysis for the former will be more difficult than the latter one [2, 29].The paper contributes the following. (1) Combining the PWLCM (one-dimensional chaotic map) with the standard map (high-dimensional chaotic map) to design encryption scheme, the analysis complexity is increased. (2) A hierarchical diffusion strategy is employed in the standard map-based permutation phase, which enhances the security. (3) The operation model of row-by-row and column-by-column is adopted in the diffusion process to promote the encryption efficiency. (4) A good trade-off between security and efficiency can be achieved, which indicates that the proposed encryption scheme can be used in real applications requiring lightweight security.The remainder of this paper is structured as follows. Section2 briefly describes and analyzes the PWLCM and the standard map. Section 3 illustrates the proposed image encryption scheme and the corresponding experimental results. Security analyses are described in Section 4. The paper finishes with concluding remarks.


## 2. Preliminaries

### 2.1. PWLCM

The piecewise linear chaotic map (PWLCM) is composed of multiple linear segments [30], which is defined by(1)xn+1=fxn,p=xnp,0≤xn≤p,xn−p0.5−p,p<xn≤0.5,f1−xn,p,0.5<xn≤1,where xn∈0,1, n∈0,1,…,, x0 is the initial state of PWLCM, and p∈0,0.5 is the control parameter of the chaotic system. According to the definition of Lyapunov exponent (LE) [31], one can easily get the LE of PWLCM λ=−0.5lnp0.5−p. Clearly, it gets the minimum value λmin=2ln2>0 at p=0.25 which means the PWLCM has chaotic behavior in the whole definition interval 0,1.The bifurcations of logistic map [31] and PWLCM are depicted in Figure 1. Figure 2 plots the Lyapunov exponent curves of logistic map and the PWLCM with variation control parameters. From the above results, one can learn that the PWLCM has a wider chaotic range and more complex behavior than logistic map. Therefore, the PWLCM is more suitable for designing image encryption scheme.Figure 1
The bifurcation analysis: bifurcations of (a) logistic map and (b) PWLCM.
(a)(b)Figure 2
The Lyapunov exponent (LE) analysis: Lyapunov exponent curves of (a) logistic map and (b) PWLCM.
(a)(b)


### 2.2. Standard Map

The standard map is an area-preserving map [4], which is defined by(2)x=x+ymod2π,y=y+Ksinx+ymod2π,where x,y∈0,2π×0,2π and K is a positive constant which determines the degree of chaos. One can verify that 0,0,π,0 are two of the fix points of equation (2). On the other hand, the Kolmogorov-Sinai entropy of the standard map is depicted by h≈lnK/2 valid for K>4 [32].The phase space of the standard map atK=0.971635 is shown in Figure 3, which also plots its Lyapunov exponent curves with variation of parameters. From the figure, it is clear that the standard map is chaotic in domain except for periodic or quasiperiodic points. To conclude, the standard map has complex dynamic behavior and good chaotic properties. Thus, it can be used for designing image encryption scheme.Figure 3
The standard map analysis: (a) the phase space of the standard map atK=0.971635; (b) the Lyapunov exponent curves of the standard map with variation of parameters.
(a)(b)For applying equation (2) to permute the image pixels, it is discretized from 0,2π×0,2π to a square lattice with a width of N [4]. By substituting xi=N/2π×x,yi=N/2π×y, i∈0,1,…, K′=N/2π×K into equation (2), we thus have(3)xi+1=xi+yimodN,yi+1=yi+K′sin2πNxi+1modN,where N is the width of the processed image and K′ is a new positive control parameter. xi,yi and xi+1,yi+1 represent the positions of the processed image pixel before and after employing the discretized standard map. Figure 4 plots the permutation results using different rounds of the discretized standard map. From the figure, one can learn that more than 3 rounds should be used to obtain enough security. Accordingly, in this paper, we will apply 3 rounds of the discretized standard map to our proposed encryption scheme, which is deferred further discussion to Section 3.Figure 4
The discretized standard map-based permutation results: (a) the original image 5.1.10.tiff and (b, c, d) permuted results using1,2,and3 rounds of the discretized standard map.
(a)(b)(c)(d)


## 2.1. PWLCM

The piecewise linear chaotic map (PWLCM) is composed of multiple linear segments [30], which is defined by(1)xn+1=fxn,p=xnp,0≤xn≤p,xn−p0.5−p,p<xn≤0.5,f1−xn,p,0.5<xn≤1,where xn∈0,1, n∈0,1,…,, x0 is the initial state of PWLCM, and p∈0,0.5 is the control parameter of the chaotic system. According to the definition of Lyapunov exponent (LE) [31], one can easily get the LE of PWLCM λ=−0.5lnp0.5−p. Clearly, it gets the minimum value λmin=2ln2>0 at p=0.25 which means the PWLCM has chaotic behavior in the whole definition interval 0,1.The bifurcations of logistic map [31] and PWLCM are depicted in Figure 1. Figure 2 plots the Lyapunov exponent curves of logistic map and the PWLCM with variation control parameters. From the above results, one can learn that the PWLCM has a wider chaotic range and more complex behavior than logistic map. Therefore, the PWLCM is more suitable for designing image encryption scheme.Figure 1
The bifurcation analysis: bifurcations of (a) logistic map and (b) PWLCM.
(a)(b)Figure 2
The Lyapunov exponent (LE) analysis: Lyapunov exponent curves of (a) logistic map and (b) PWLCM.
(a)(b)


## 2.2. Standard Map

The standard map is an area-preserving map [4], which is defined by(2)x=x+ymod2π,y=y+Ksinx+ymod2π,where x,y∈0,2π×0,2π and K is a positive constant which determines the degree of chaos. One can verify that 0,0,π,0 are two of the fix points of equation (2). On the other hand, the Kolmogorov-Sinai entropy of the standard map is depicted by h≈lnK/2 valid for K>4 [32].The phase space of the standard map atK=0.971635 is shown in Figure 3, which also plots its Lyapunov exponent curves with variation of parameters. From the figure, it is clear that the standard map is chaotic in domain except for periodic or quasiperiodic points. To conclude, the standard map has complex dynamic behavior and good chaotic properties. Thus, it can be used for designing image encryption scheme.Figure 3
The standard map analysis: (a) the phase space of the standard map atK=0.971635; (b) the Lyapunov exponent curves of the standard map with variation of parameters.
(a)(b)For applying equation (2) to permute the image pixels, it is discretized from 0,2π×0,2π to a square lattice with a width of N [4]. By substituting xi=N/2π×x,yi=N/2π×y, i∈0,1,…, K′=N/2π×K into equation (2), we thus have(3)xi+1=xi+yimodN,yi+1=yi+K′sin2πNxi+1modN,where N is the width of the processed image and K′ is a new positive control parameter. xi,yi and xi+1,yi+1 represent the positions of the processed image pixel before and after employing the discretized standard map. Figure 4 plots the permutation results using different rounds of the discretized standard map. From the figure, one can learn that more than 3 rounds should be used to obtain enough security. Accordingly, in this paper, we will apply 3 rounds of the discretized standard map to our proposed encryption scheme, which is deferred further discussion to Section 3.Figure 4
The discretized standard map-based permutation results: (a) the original image 5.1.10.tiff and (b, c, d) permuted results using1,2,and3 rounds of the discretized standard map.
(a)(b)(c)(d)


## 3. Our Proposed Image Encryption Scheme

### 3.1. The Encryption Process

In this section, we give in detail the encryption process of the proposed scheme. Without loss of generality, letP be the plain image with a size of MN=M×N. Note that Key is the external 256-bit secure secret key. To help understand the framework of our proposal, Figure 5 and Algorithm 1 give the flowchart and the pseudo-random code of the proposed image encryption scheme, respectively.Figure 5
The flowchart of the proposed image encryption scheme.Algorithm 1: The proposed image encryption scheme.
(1)
Input the plain imagePM×N.(2)
Create an initial state and a parameter of PWLCM:x10,p1.(3)
GeneratestepM×N.(4)
Create a new initial state and a parameter of PWLCM:x20,p2.(5)
Calculate the vectors:keyr1×M,keycN×1,ivr1×M,ivcN×1.(6)
forik=1:iterdo(7)
Initialize permuted imageP1M×N.(8)
forik1=1:iterp % Improved permutation process do(9)
fori1=0:M−1do(10)
fori2=0:N−1do(11)
Calculates1,s2 and a shift amount SA.(12)
P1s1+1,s2+1=bitcircshiftPi1+1,i2+1,SA.(13)
end for(14)
end for(15)
P=P1.(16)
end for(17)
Initialize medium and encrypted image:P2M×N, P3M×N.(18)
forik2=1:iterddo % High-speed diffusion(19)
fori=1:Mdo(20)
Perform row diffusion to getP2M×N.(21)
end for(22)
forj=1:Ndo(23)
Perform column diffusion to obtainP3M×N.(24)
end For(25)
P1=P3.(26)
end for(27)
P=P3.(28)
end for(29)
Output the final encrypted imageP3M×N.


#### 3.1.1. Improved Permutation Process

Step 1. Generating the initial state and the parameter of PWLCM: let xhw,phwh,w=1,2 be the initial states and the parameters used in permutation and diffusion phases. Given a 256-bit secret Key, we calculate two float numbers x11,p11 using FN=∑iKeyi×2−i, i∈1,2,…, based on its first two 64-bit streams, respectively. Similarly, two float numbers x12,p12 are generated by the last two 64-bit streams of Key, respectively.Step 2. Generating the new initial state and parameter of PWLCM: let x10,p1 be the new initial state and parameter, respectively. Then, compute their values by x10=x11+x12mod1, p1=p11+p12mod0.5, where the notation αmodβ denotes the remainder of α upon division by β. Namely, for any two real numbers α, β≠0, αmodβ=α−β⌊α/β⌋.Step 3. Creating the pseudo-random sequence: iterate PWLCM MN times with x10,q1 to obtain sequence x11×MN. To avoid the transient effect, we drop the first N0 iterated values. We then further quantify x1 to get step01×MN using step0=modroundx1−⌊x1⌋×1015,8+1 where roundx rounds x to the nearest integer and b=moda,m returns the remainder after division of a by m. Finally, step01×MN is reshaped to stepM×N from top to bottom and left to right.Step 4. Initializing the permutation process: firstly, the 256-bit external secret key is divided into four parts. More concretely, the first three parts are the same length of 53-bit, and the length of the last part is 44-bit. Then, we set each part as the input of ∑iKeyi×2i, i∈1,2,… and get the sum of each result K0. The control parameter PSK is obtained by K0mod1024. Finally, initialize the permuted image as P1M×N. Let i1=0,1,…,M−1,i2=0,1,…,N−1; calculating new position s1,s2 based on s1=i1+i2modM, s2=i2+roundPSK×sin2π/Ns1modN.Step 5. Performing the bit-level circularly shift and the pixel-level permutation simultaneously: firstly, we obtain the bit-level circle shift direction dir by using dir=2×dir0−1 where dir0=stepi1+1,i2+1mod2. We then perform a bit shift on the plain image’s pixel Pi1+1,i2+1 by a shift amount SA=dir×stepi1+1,i2+1. In particular, positive SA shifts toward the end of binary array and negative SA shifts toward the beginning. At the same time, permute circularly shifted pixel to the corresponding position in permuted image P1s1+1,s2+1. Let P = P1 and iterate above shuffling method iterp times to obtain the final permuted image P1.


#### 3.1.2. High-Speed Diffusion Process

Step 6. Getting chaotic sequences: similar to the way in the permutation phase, we first calculate the new initial state and the parameter for PWLCM. After assigning the first two 64-bit streams of Key to float numbers p21,x21, their decimal values can obtained by the way in Step 1, respectively. In a similar manner, the float numbers p22,x22 are generated by the last two 64-bit streams of Key, respectively. Then, we can obtain the new initial state x20 and the parameter p2 by x20=x21+x22mod1, p2=p21+p22mod0.5. Lastly, we iterate PWLCM M+N times to get x21×M+N and further generate a row array x2r1×M and a column array x2cN×1.Step 7. Generating four seed vectors: firstly, we quantify x2r,x2c to obtain two chaos-based seed vectors keyr1×M,keycN×1 by keyr=⌊x2r−⌊x2r⌋×1014⌋mod256, keyc=⌊x2c−⌊x2c⌋×1014⌋mod256, respectively. Then, in a similar way, two initial vectors ivr1×M,ivcN×1 are calculated by ivr=⌊x2r×1014⌋mod256, ivc=⌊x2c×1014⌋mod256, respectively.Step 8. Perform the high-speed diffusion process: set i=1,2,…,M, performing the element-level circularly shift operation on keyr by i shift amounts to get r11×M. Then, we can obtain the row-by-row diffusion encrypted image P2 using equation (4). Similarly, set j=1,2,…,M, we utilize circularly shift process on keyc by j steps to get a seed vector c1M×1. Then, we get the column-by-column diffusion encrypted image P3 based on equation (5). Let P1=P3; iterate iterd times to get the final diffusion encrypted image P3.(4)P2i,:=modP1i,:+r1,256⊕ivr,ifi=1,modP1i,:+r1,256⊕P2i−1,:,else,wherea⊕b returns the bitwise XOR of a and b.(5)P3:,j=modP2:,j+c1,256⊕ivc,ifj=1,modP2:,j+c1,256⊕P3:,j−1,else.Step 9. Finally, set P=P3, performing repeatedly single round encryption process iter times to get the final encrypted image P3.


### 3.2. The Decryption Process

The proposed image encryption scheme belongs to a symmetry cipher algorithm. Thus, the decryption process for it is simply the inversion of the encryption process. We do not include the steps here to conserve space.


### 3.3. Numerical Experimental Results

This section discusses the numerical experimental results for the proposed image encryption scheme. Our experiments in this paper are performed on a laptop computer equipped with an Intel(R) Core(TM) i7-5500U CPU @ 2.40 GHz, 4 GB memory, and Windows 7 operating system. We adopt Matlab platform to implement the proposed encryption scheme. On the other hand, three plain images (5.1.11.tiff to 5.1.13.tiff) are randomly selected from the USC-SIPI Image Database [33]. The function rand which returns uniformly distributed pseudo-random numbers is utilized to generate Key. For convenience, we set iterp,iterd,iter=3,1,2. It is noted that the value of iter should be large enough to maintain the desired security when it comes to the real-world application. After performing the proposed encryption scheme, the obtained experimental results are shown in Figure 6. From the results, the observer cannot obtain any visual information about plain image. The decrypted images are identical to the plain images. Moreover, even if the encrypted image is chosen by any arbitrary way, the receiver can obtain the original image only using the corrective secret key. This indicates that the proposed encryption scheme is effective in the basic sense of symmetry algorithm.Figure 6
Numerical experimental results: (a, d, g) plain images 5.1.11.tiff, 5.1.12.tiff, and 5.1.13.tiff; (b, e, h) encrypted images corresponding to (a), (d), and (g); (c, f, i) recovered images corresponding to (b), (e), and (h).
(a)(b)(c)(d)(e)(f)(g)(h)(i)


## 3.1. The Encryption Process

In this section, we give in detail the encryption process of the proposed scheme. Without loss of generality, letP be the plain image with a size of MN=M×N. Note that Key is the external 256-bit secure secret key. To help understand the framework of our proposal, Figure 5 and Algorithm 1 give the flowchart and the pseudo-random code of the proposed image encryption scheme, respectively.Figure 5
The flowchart of the proposed image encryption scheme.Algorithm 1: The proposed image encryption scheme.
(1)
Input the plain imagePM×N.(2)
Create an initial state and a parameter of PWLCM:x10,p1.(3)
GeneratestepM×N.(4)
Create a new initial state and a parameter of PWLCM:x20,p2.(5)
Calculate the vectors:keyr1×M,keycN×1,ivr1×M,ivcN×1.(6)
forik=1:iterdo(7)
Initialize permuted imageP1M×N.(8)
forik1=1:iterp % Improved permutation process do(9)
fori1=0:M−1do(10)
fori2=0:N−1do(11)
Calculates1,s2 and a shift amount SA.(12)
P1s1+1,s2+1=bitcircshiftPi1+1,i2+1,SA.(13)
end for(14)
end for(15)
P=P1.(16)
end for(17)
Initialize medium and encrypted image:P2M×N, P3M×N.(18)
forik2=1:iterddo % High-speed diffusion(19)
fori=1:Mdo(20)
Perform row diffusion to getP2M×N.(21)
end for(22)
forj=1:Ndo(23)
Perform column diffusion to obtainP3M×N.(24)
end For(25)
P1=P3.(26)
end for(27)
P=P3.(28)
end for(29)
Output the final encrypted imageP3M×N.


### 3.1.1. Improved Permutation Process

Step 1. Generating the initial state and the parameter of PWLCM: let xhw,phwh,w=1,2 be the initial states and the parameters used in permutation and diffusion phases. Given a 256-bit secret Key, we calculate two float numbers x11,p11 using FN=∑iKeyi×2−i, i∈1,2,…, based on its first two 64-bit streams, respectively. Similarly, two float numbers x12,p12 are generated by the last two 64-bit streams of Key, respectively.Step 2. Generating the new initial state and parameter of PWLCM: let x10,p1 be the new initial state and parameter, respectively. Then, compute their values by x10=x11+x12mod1, p1=p11+p12mod0.5, where the notation αmodβ denotes the remainder of α upon division by β. Namely, for any two real numbers α, β≠0, αmodβ=α−β⌊α/β⌋.Step 3. Creating the pseudo-random sequence: iterate PWLCM MN times with x10,q1 to obtain sequence x11×MN. To avoid the transient effect, we drop the first N0 iterated values. We then further quantify x1 to get step01×MN using step0=modroundx1−⌊x1⌋×1015,8+1 where roundx rounds x to the nearest integer and b=moda,m returns the remainder after division of a by m. Finally, step01×MN is reshaped to stepM×N from top to bottom and left to right.Step 4. Initializing the permutation process: firstly, the 256-bit external secret key is divided into four parts. More concretely, the first three parts are the same length of 53-bit, and the length of the last part is 44-bit. Then, we set each part as the input of ∑iKeyi×2i, i∈1,2,… and get the sum of each result K0. The control parameter PSK is obtained by K0mod1024. Finally, initialize the permuted image as P1M×N. Let i1=0,1,…,M−1,i2=0,1,…,N−1; calculating new position s1,s2 based on s1=i1+i2modM, s2=i2+roundPSK×sin2π/Ns1modN.Step 5. Performing the bit-level circularly shift and the pixel-level permutation simultaneously: firstly, we obtain the bit-level circle shift direction dir by using dir=2×dir0−1 where dir0=stepi1+1,i2+1mod2. We then perform a bit shift on the plain image’s pixel Pi1+1,i2+1 by a shift amount SA=dir×stepi1+1,i2+1. In particular, positive SA shifts toward the end of binary array and negative SA shifts toward the beginning. At the same time, permute circularly shifted pixel to the corresponding position in permuted image P1s1+1,s2+1. Let P = P1 and iterate above shuffling method iterp times to obtain the final permuted image P1.


### 3.1.2. High-Speed Diffusion Process

Step 6. Getting chaotic sequences: similar to the way in the permutation phase, we first calculate the new initial state and the parameter for PWLCM. After assigning the first two 64-bit streams of Key to float numbers p21,x21, their decimal values can obtained by the way in Step 1, respectively. In a similar manner, the float numbers p22,x22 are generated by the last two 64-bit streams of Key, respectively. Then, we can obtain the new initial state x20 and the parameter p2 by x20=x21+x22mod1, p2=p21+p22mod0.5. Lastly, we iterate PWLCM M+N times to get x21×M+N and further generate a row array x2r1×M and a column array x2cN×1.Step 7. Generating four seed vectors: firstly, we quantify x2r,x2c to obtain two chaos-based seed vectors keyr1×M,keycN×1 by keyr=⌊x2r−⌊x2r⌋×1014⌋mod256, keyc=⌊x2c−⌊x2c⌋×1014⌋mod256, respectively. Then, in a similar way, two initial vectors ivr1×M,ivcN×1 are calculated by ivr=⌊x2r×1014⌋mod256, ivc=⌊x2c×1014⌋mod256, respectively.Step 8. Perform the high-speed diffusion process: set i=1,2,…,M, performing the element-level circularly shift operation on keyr by i shift amounts to get r11×M. Then, we can obtain the row-by-row diffusion encrypted image P2 using equation (4). Similarly, set j=1,2,…,M, we utilize circularly shift process on keyc by j steps to get a seed vector c1M×1. Then, we get the column-by-column diffusion encrypted image P3 based on equation (5). Let P1=P3; iterate iterd times to get the final diffusion encrypted image P3.(4)P2i,:=modP1i,:+r1,256⊕ivr,ifi=1,modP1i,:+r1,256⊕P2i−1,:,else,wherea⊕b returns the bitwise XOR of a and b.(5)P3:,j=modP2:,j+c1,256⊕ivc,ifj=1,modP2:,j+c1,256⊕P3:,j−1,else.Step 9. Finally, set P=P3, performing repeatedly single round encryption process iter times to get the final encrypted image P3.


## 3.1.1. Improved Permutation Process

Step 1. Generating the initial state and the parameter of PWLCM: let xhw,phwh,w=1,2 be the initial states and the parameters used in permutation and diffusion phases. Given a 256-bit secret Key, we calculate two float numbers x11,p11 using FN=∑iKeyi×2−i, i∈1,2,…, based on its first two 64-bit streams, respectively. Similarly, two float numbers x12,p12 are generated by the last two 64-bit streams of Key, respectively.Step 2. Generating the new initial state and parameter of PWLCM: let x10,p1 be the new initial state and parameter, respectively. Then, compute their values by x10=x11+x12mod1, p1=p11+p12mod0.5, where the notation αmodβ denotes the remainder of α upon division by β. Namely, for any two real numbers α, β≠0, αmodβ=α−β⌊α/β⌋.Step 3. Creating the pseudo-random sequence: iterate PWLCM MN times with x10,q1 to obtain sequence x11×MN. To avoid the transient effect, we drop the first N0 iterated values. We then further quantify x1 to get step01×MN using step0=modroundx1−⌊x1⌋×1015,8+1 where roundx rounds x to the nearest integer and b=moda,m returns the remainder after division of a by m. Finally, step01×MN is reshaped to stepM×N from top to bottom and left to right.Step 4. Initializing the permutation process: firstly, the 256-bit external secret key is divided into four parts. More concretely, the first three parts are the same length of 53-bit, and the length of the last part is 44-bit. Then, we set each part as the input of ∑iKeyi×2i, i∈1,2,… and get the sum of each result K0. The control parameter PSK is obtained by K0mod1024. Finally, initialize the permuted image as P1M×N. Let i1=0,1,…,M−1,i2=0,1,…,N−1; calculating new position s1,s2 based on s1=i1+i2modM, s2=i2+roundPSK×sin2π/Ns1modN.Step 5. Performing the bit-level circularly shift and the pixel-level permutation simultaneously: firstly, we obtain the bit-level circle shift direction dir by using dir=2×dir0−1 where dir0=stepi1+1,i2+1mod2. We then perform a bit shift on the plain image’s pixel Pi1+1,i2+1 by a shift amount SA=dir×stepi1+1,i2+1. In particular, positive SA shifts toward the end of binary array and negative SA shifts toward the beginning. At the same time, permute circularly shifted pixel to the corresponding position in permuted image P1s1+1,s2+1. Let P = P1 and iterate above shuffling method iterp times to obtain the final permuted image P1.


## 3.1.2. High-Speed Diffusion Process

Step 6. Getting chaotic sequences: similar to the way in the permutation phase, we first calculate the new initial state and the parameter for PWLCM. After assigning the first two 64-bit streams of Key to float numbers p21,x21, their decimal values can obtained by the way in Step 1, respectively. In a similar manner, the float numbers p22,x22 are generated by the last two 64-bit streams of Key, respectively. Then, we can obtain the new initial state x20 and the parameter p2 by x20=x21+x22mod1, p2=p21+p22mod0.5. Lastly, we iterate PWLCM M+N times to get x21×M+N and further generate a row array x2r1×M and a column array x2cN×1.Step 7. Generating four seed vectors: firstly, we quantify x2r,x2c to obtain two chaos-based seed vectors keyr1×M,keycN×1 by keyr=⌊x2r−⌊x2r⌋×1014⌋mod256, keyc=⌊x2c−⌊x2c⌋×1014⌋mod256, respectively. Then, in a similar way, two initial vectors ivr1×M,ivcN×1 are calculated by ivr=⌊x2r×1014⌋mod256, ivc=⌊x2c×1014⌋mod256, respectively.Step 8. Perform the high-speed diffusion process: set i=1,2,…,M, performing the element-level circularly shift operation on keyr by i shift amounts to get r11×M. Then, we can obtain the row-by-row diffusion encrypted image P2 using equation (4). Similarly, set j=1,2,…,M, we utilize circularly shift process on keyc by j steps to get a seed vector c1M×1. Then, we get the column-by-column diffusion encrypted image P3 based on equation (5). Let P1=P3; iterate iterd times to get the final diffusion encrypted image P3.(4)P2i,:=modP1i,:+r1,256⊕ivr,ifi=1,modP1i,:+r1,256⊕P2i−1,:,else,wherea⊕b returns the bitwise XOR of a and b.(5)P3:,j=modP2:,j+c1,256⊕ivc,ifj=1,modP2:,j+c1,256⊕P3:,j−1,else.Step 9. Finally, set P=P3, performing repeatedly single round encryption process iter times to get the final encrypted image P3.


## 3.2. The Decryption Process

The proposed image encryption scheme belongs to a symmetry cipher algorithm. Thus, the decryption process for it is simply the inversion of the encryption process. We do not include the steps here to conserve space.


## 3.3. Numerical Experimental Results

This section discusses the numerical experimental results for the proposed image encryption scheme. Our experiments in this paper are performed on a laptop computer equipped with an Intel(R) Core(TM) i7-5500U CPU @ 2.40 GHz, 4 GB memory, and Windows 7 operating system. We adopt Matlab platform to implement the proposed encryption scheme. On the other hand, three plain images (5.1.11.tiff to 5.1.13.tiff) are randomly selected from the USC-SIPI Image Database [33]. The function rand which returns uniformly distributed pseudo-random numbers is utilized to generate Key. For convenience, we set iterp,iterd,iter=3,1,2. It is noted that the value of iter should be large enough to maintain the desired security when it comes to the real-world application. After performing the proposed encryption scheme, the obtained experimental results are shown in Figure 6. From the results, the observer cannot obtain any visual information about plain image. The decrypted images are identical to the plain images. Moreover, even if the encrypted image is chosen by any arbitrary way, the receiver can obtain the original image only using the corrective secret key. This indicates that the proposed encryption scheme is effective in the basic sense of symmetry algorithm.Figure 6
Numerical experimental results: (a, d, g) plain images 5.1.11.tiff, 5.1.12.tiff, and 5.1.13.tiff; (b, e, h) encrypted images corresponding to (a), (d), and (g); (c, f, i) recovered images corresponding to (b), (e), and (h).
(a)(b)(c)(d)(e)(f)(g)(h)(i)


## 4. Performance Analysis

### 4.1. Histogram Analysis

An image histogram gives the entire intensity value distribution visually in an image [34]. An ideal encryption scheme should be able to generate final encrypted image uniformly distributed. To see this, Figure 7 plots the histograms of plain images 5.1.11.tiff, 5.1.12.tiff, and 5.1.13.tiff, the final encrypted images generated by the proposed encryption scheme, and the corresponding recovered images, respectively. From the figure, one can obviously observe that the histograms of the plain images are statistically significant while the encrypted images are uniformly distributed. Thus, the histogram will not leak any useful information to attackers.Figure 7
Histogram analysis: (a, d, g) the histograms of plain images 5.1.11.tiff, 5.1.12.tiff, and 5.1.13.tiff; (b, e, h) the histograms of the respective encrypted results; (c, f, i) the histograms of the respective recovered images.
(a)(b)(c)(d)(e)(f)(g)(h)(i)In addition, the chi-square test [35] is further applied to quantitatively evaluate the uniformity of the histograms. It is mathematically defined by(6)χtest2=∑v=0255fv−d2d,d=M×N256,where fv is the frequency of each gray level v∈0,1,…,255 for a 8-bit gray-scale image and M×N is the size of the tested image. With a significance level of 0.05, the theoretical chi-square value is χ0.052=293.2478 [35]. A smaller experimental value indicates the more uniform distribution for a specific image histogram. In our proposed test analysis, we randomly selected 6 gray-scale plain images (5.1.09.tiff through 5.1.14.tiff). The corresponding test results are listed in Table 1. Moreover, we also perform the chi-square tests on the scheme presented in [18]. Their test results are also included in Table 1. Based on the mean value and pass rate in the table, we can conclude that proposed encryption scheme provides better performance than the compared algorithm.Table 1
Chi-square test analysis.
File nameχ255,0.052χ2 (proposed)χ2 (reference [18])5.1.09.tiff293.2478251.7578248.85165.1.10.tiff293.2478227.8750217.42195.1.11.tiff293.2478251.4453228.60165.1.12.tiff293.2478276.6172259.81255.1.13.tiff293.2478229.3281362.82035.1.14.tiff293.2478238.1797248.6172Mean293.2478211.6004224.4464Pass rate—6/65/6


### 4.2. Correlation Analysis

The adjacent pixels in a natural image are strongly correlated. A good image encryption scheme should have a low correlation in different adjacent directions [13]. To evaluate the proposed encryption scheme, we randomly select 5000 pairs of pixels of the encrypted image in the horizontal, vertical, and diagonal directions, respectively. Then, the correlation coefficient of each pair, defined in (7), is calculated.(7)Ex=1N∑i=1Nxi,Dx=1N∑i=1Nxi−Ex2,covx,y=1N∑i=1Nxi−Exyi−Ey,rxy=covx,yDx×Dy,where x and y are the adjacent pixel sequences selected from the different directions, N=5000 is the size of the selected pixel sequence, and Ex and Dx are the mean and the standard deviation of x, respectively. If the selected pixel sequences have low correlation, their coefficient calculated by equation (7) should be close to 0. Otherwise, it will be close to 1 [13]. Figure 8 shows the selected pixel sequence distributions in different directions, and Table 2 lists the calculated results where H, V, and D denote the horizontal, vertical, and diagonal directions, respectively. Besides, we also calculate the correlation coefficients for the encrypted image generated by the encryption scheme presented in [18], and the results are also included in Table 2. While the distributions in plain image are close to diagonal line, the distributions in the encrypted image are randomly scattered. Similarly, the quantitative results in plain image are close to 1 while the resulting values in the encrypted image are close to 0. Therefore, both figures and tables show that the plain image has strong relationships but that weakness exists in the encrypted image. Furthermore, in most cases, the proposed encryption scheme outperforms the compared method. From the above analysis, we infer that our proposed encryption scheme can efficiently eliminate the strong correlation of the adjacent pixels.Figure 8
Correlation analysis: (a, c, e) the pixel sequence distributions of the plain image 5.1.12.tiff in the horizontal, vertical, and diagonal directions, respectively; (b, d, f) the pixel distributions of the corresponding encrypted image in the horizontal, vertical, and diagonal directions.
(a)(b)(c)(d)(e)(f)Table 2
Correlation analysis.
File nameDirectionsPlain imageProposedReference [18]5.1.09.tiffH0.9051−0.0062−0.0109V0.94170.0278−0.0067D0.90780.0061−0.00895.1.10.tiffH0.90120.0251−0.0138V0.8553−0.0228−0.0043D0.8338−0.0098−0.02215.1.11.tiffH0.95920.0307−0.0133V0.9419−0.02500.0121D0.8878−0.0261−0.00425.1.12.tiffH0.9538−0.0031−0.0059V0.9747−0.0196−0.0148D0.9327−0.01100.00725.1.13.tiffH0.8762−0.01850.0102V0.85970.0043−0.0104D0.75370.0219−0.00925.1.14.tiffH0.94770.00590.0122V0.9009−0.0149−0.0227D0.84780.0094−0.0073


### 4.3. Information Entropy Analysis

Information entropy measures the randomness and unpredictability of a random sequencek [36]. It is defined by(8)Hk=−∑i=02L−1Pkilog2Pki,where Pki, i∈0,1,…,2L−1, denotes the probability of the ith symbol ki. The ideal entropy value for an image with 28 gray levels should be 8 [37]. We randomly test 6 plain images (5.1.09.tiff through 5.1.14.tiff) from the USC-SIPI Image Database. The calculated results of the encrypted images generated by the proposed encryption scheme and the method presented in [18] are listed in Table 3. From the mean value results, we deduce that the proposed encryption scheme provides better randomness. Moreover, the local Shannon entropy (LSE) is adopted to evaluate the randomness of an image from local view [38]. It is computed by(9)H¯k,TBm=∑i=1kHSik,where k is the total number of selected nonoverlapping image block Si and TB is noted as the number of pixel in each block. With the significance level α=0.05 and the parameters k,TB=30,1936, the theoretical LSE interval is 7.9019,7.9030 for a 8-bit image [38]. To see our proposal, Table 4 gives the LSE values for the proposed method and the compared algorithm presented in [18]. It is obvious that the LSE values of the encrypted images obtained by our proposal are in the theoretical interval, and most of the results are bigger than the compared algorithm, which means that the proposed method has better randomness in terms of local view.Table 3
Information entropy analysis.
File namePlain imageProposedReference [18]5.1.09.tiff6.70937.99727.99735.1.10.tiff7.31187.99757.99765.1.11.tiff6.45237.99727.99755.1.12.tiff6.70577.99697.99715.1.13.tiff1.54837.99757.99605.1.14.tiff7.34247.99747.9973Mean6.01167.99737.9971Table 4
Local Shannon entropy (LSE) analysis.
File namePlain imageProposedReference [18]5.1.09.tiff6.20337.90477.90065.1.10.tiff7.02587.90247.90395.1.11.tiff5.20507.90527.90345.1.12.tiff5.18677.90267.90195.1.13.tiff1.47657.90477.90145.1.14.tiff6.68187.90367.9043Mean5.29657.90397.9026


### 4.4. Key Space Analysis

Key space is composed of all possible secret keys. Specifically, the key space of a high security encryption scheme should larger than2100 to counter brute force attack [39]. In our proposed encryption scheme, the key space is generated by a 256 random bit string, which is large enough to satisfy the standard requirement. Moreover, Table 5 lists the key spaces of five schemes. It is clear that the proposed encryption scheme can resist the brute force attack and can be comparable with the methods proposed in [18, 40–42].Table 5
Key space analysis.
AlgorithmReference [40]Reference [41]Reference [18]Reference [42]ProposedKey size2256229921992384×10382256


### 4.5. Key Sensitivity Analysis

The key sensitivity means that a slight disturbance of the secret key should generate a totally different result in both the encryption and decryption processes [43]. For a strong robust encryption scheme, it should be extremely sensitive to its secret key variations. The two-dimensional correlation coefficient cAB between two random images A, B is adopted to examine the key sensitivity, which is defined as(10)A¯=1H×W∑i=1H∑j=1WAi,j,B¯=1H×W∑i=1H∑j=1WBi,j,covAB=1H×W∑i=1H∑i=1WAi,j−A¯Bi,j−B¯,DA=1H×W∑i=1H∑j=1WAi,j−A¯,DB=1H×W∑i=1H∑j=1WBi,j−B¯,cAB=covABDA×DB,where H×W is the size of the tested image. Generally, the smaller the coefficient value, the lower correlation between two random images [14, 44].In our proposed key sensitivity analysis, we first randomly generate a 256-bit secretKey. To obtain two new keys with only 1-bit difference, which are denoted as Keyii=1,2, respectively, we repeatedly change one bit of Key two times. We then perform the proposed encryption scheme with Key and Keyi on the plain image 5.1.13.tiff to get the respective encrypted images C and Cii=1,2. The different cipher images are shown in Figure 9, which also plots the differences C−Cii=1,2. As can be seen, the encrypted images generated by the keys with slight difference are completely different. Additionally, we calculate the respective two-dimensional correlation coefficients between C and Ci. Table 6 gives the calculated results which are close to 0. Hence, the proposed encryption scheme is sensitive to its secret key in the cipher process.Figure 9
Encryption key sensitivity analysis: (a) the cipher imageC; (b, d) the cipher images Cii=1,2; (c, e) the differences C−Cii=1,2.
(a)(b)(c)(d)(e)Table 6
Encryption key sensitivity analysis.
C1C2C−0.0060−2.1728e − 04For the decryption analysis process, we decipherC with Key and Kii=1,2 to obtain the recovered images D and Di, respectively. The different decipher results are shown in Figure 10, which also plots the differences D−Dii=1,2. Moreover, the correlation coefficients between D and Di are listed in Table 7. From the figure and table, one can see that the proposed encryption scheme is sensitive to its secret key in the decipher process. Combining the aforementioned encryption key sensitivity analysis, we conclude that the proposed image encryption scheme is extremely sensitive to secret key.Figure 10
Decryption key sensitivity analysis: (a) the recovered imageD; (b, d) the recovered images Dii=1,2; (c, e) the differences D−Dii=1,2.
(a)(b)(c)(d)(e)Table 7
Decryption key sensitivity analysis.
D1D2D0.00140.0040


### 4.6. Noise and Data Loss Attack Analysis

Traditionally, when an encrypted image is transmitted through an unsecure network or stored in physical medias, it is easy to surfer from the noise perturbation or the data loss. So, a strong robust image encryption scheme should have the ability to minimize the bad effect caused by the noise perturbation and the data loss [45]. In our proposed analysis, we adopt peak signal-to-noise ratio (PSNR) to measure the quality of the reconstruction [46, 47]. Given a gray-scale image I1 with size of M×N and its noisy approximation I2, it is defined as(11)MSE=1M×N∑i=1M∑j=1NI1i,j−I2i,j2,PSNR=10×log10255×255MSEdB,where MSE denotes the mean square error between I1 and I2. Typical values for the PSNR in lossy image compression are between 30 dB and 50 dB, provided the bit depth is 8 bits, where the higher is better [48]. We perform the proposed encryption scheme on plain image 5.1.10.tiff to generate the encrypted image. Then, we add salt and pepper noises (SPNs) to the encrypted image with 0.01,0.02,and0.03 densities, respectively. As a result, Figure 11 plots these noisy results and their recovered images, respectively. As can be seen, the recovered images are visually recognizable. Moreover, Table 8 lists the PSNR (in dB) values which indicates that the proposed encryption scheme can resist noise affect. It also shows the results computed by the compared algorithms presented in [18, 40–42]. Clearly, our proposal can be comparable with the recent works. Likewise, the Gaussian white noise with constant mean and different variances is also applied to evaluate the ability of resisting noise attack. The tested results are given in Table 9 which carries out that our proposal can also resist the Gaussian white noise.Figure 11
Noise attack analysis: (a, b, c) the noisy encrypted images by SPN with0.01,0.03,and0.05 densities; (d, e, f) the deciphered images of (a), (b), and (c).
(a)(b)(c)(d)(e)(f)Table 8
Noise attack analysis-I (dB).
Noise density0.010.030.05Proposed32.821830.787129.9716Reference [18]28.692328.693728.7211Reference [40]28.704428.707128.6974Reference [41]32.562229.954329.7082Reference [42]30.217329.449429.3079Table 9
Noise attack analysis-II (dB).
Variances0.000010.000050.0007Proposed28.712128.701928.6937Reference [18]28.711328.700028.7132Reference [40]28.711328.720728.6930Reference [41]28.711428.708028.7246Reference [42]28.711428.725928.7147Similarly, we perform the occlusion attack analysis. Figure12 shows the loss results by cutting 1/8,1/8,and1/4 of the encrypted image. On the other hand, Table 10 gives the PSNR values between the plain image and the reconstructed results. Both figure and table demonstrate that our proposed encryption scheme can offer cutting resistance. Combining with above noise attack analysis, we infer that the proposed encryption scheme provides resistance against noise and data loss effects.Figure 12
Data loss analysis: (a, b, c) the loss results by cutting1/8,1/8,and1/4 of the encrypted image; (d, e, f) the deciphered images of (a), (b), and (c).
(a)(b)(c)(d)(e)(f)Table 10
Data loss analysis (dB).
Loss rate1/81/81/4Proposed32.149232.377329.8749Reference [18]28.695328.703128.7158Reference [40]28.699728.693928.6945Reference [41]30.964330.936830.9225Reference [42]34.846833.436233.4350


### 4.7. Differential Attack Analysis

The differential attack analysis is referred to how tiny change in the plain image can influence the encrypted image. More specifically, the invader can make a slight change in the plain image, and then examine their encryption difference, which aims to get the information about the secret key. Therefore, a high-level security encryption scheme should withstand this kind of attack [29, 49]. The number of pixels change rate (NPCR) and the unified average changing intensity (UACI), defined in equation (12), are used to numerically evaluate the ability to resist differential attack.(12)NPCR=∑i,jDi,jM×N×100%,UACI=1M×N∑i,jC1i,j−C2i,j255×100%,where C1i,j and C2i,j, i∈1,…,M, j∈1,…,N, are, respectively, two encrypted images whose plain images have only 1-bit difference. Di,j=1 if C1i,j≠C2i,j; otherwise, Di,j=0. M×N is the size of plain image. With the significance level α=0.05, the theoretical NPCR value is 99.5693% for an image of size 256×256. For the UACI, its ideal interval is 33.2824%,33.6447% [1]. The closer to the theoretical value or interval, the stronger the ability to resist the differential attack.In the proposed analysis, we randomly choose one pixel in six plain images and change its value by 1-bit to generate changed six plain images. They are then encrypted by the proposed encryption scheme and the method presented in [18] to obtain the corresponding encrypted images. Finally, the NPCR and UACI values between these results are listed in Table 11. This indicates that the proposed scheme has qualified performance to resist differential attack in the statistical sense.Table 11
Differential attack analysis (%).
Test imageNPCRUACIProposedReference [18]ProposedReference [18]5.1.09.tiff99.575830.452433.618111.17305.1.10.tiff99.609472.084033.338324.38935.1.11.tiff99.630791.113333.602637.89875.1.12.tiff99.568283.525133.351433.38995.1.13.tiff99.578992.404233.281231.06405.1.14.tiff99.620198.559633.473832.8520Average99.597278.356433.444228.4612


### 4.8. Chosen Plain Image and Known Plain Image Attack Analysis

Security against chosen plain image attack means that the attacker cannot tell which of these two possible plain images were encrypted with probability significantly better than random guessing [50]. In the proposed encryption scheme, we adopt a bit-level circularly shift operation on plain image in the permutation phase. As a result, different encrypted images will be generated by a slightly changed plain image. In addition, chaos-based pseudo-random sequences are further employed to diffuse the permuted image. Therefore, the proposed encryption scheme could successfully resist the chosen plain image and known plain image attack.


### 4.9. Time Complexity Analysis

The time complexity measures the amount of time taken by an encryption scheme to run as a function of the size of plain image [51–53]. Clearly, the lower the value of running time, the higher the efficiency. However, a complete comparison would be unfair due to the incommensurable difference in terms of the programming skills and the equipment adopted for testing. Nevertheless, in order to evaluate the proposed encryption scheme, Table 12 lists the one round running times on the same platform and the same plain images (5.1.10.tiff (256×256), 5.1.08.tiff (512×512), and 5.3.01.tiff (1024×1024)) for our proposal and the compared algorithms presented in [18, 40–42]. On the other hand, one can learn that the computational cost of the proposed encryption scheme is O(MN) with the big-O notation, where M and N represent the size of the plain image in pixels. It is clear that the proposed scheme can be comparable with the existing algorithms.Table 12
Time complexity analysis (second).
Image sizeReference [40]Reference [41]Reference [18]Reference [42]Proposed256×2560.02820.47621.499318.44541.0196512×5120.04371.38435.956873.01983.99241024×10240.17855.564023.9620291.604716.0123


### 4.10. Randomness of the Encrypted Image Analysis

In this section, the National Institute of Standards and Technology (NIST) 800.22 statistical test suite is adopted for the randomness test of the encrypted image generated by the proposed encryption scheme. The test results for plain image 5.1.12.tiff are listed in Table13. Clearly, each P value corresponding to a particular test is bigger than 0.01 [54]. Hence, the acquired encrypted image can pass all the NIST 800.22 statistical tests at the 1% level of significance, which implies that the encrypted image generated by our proposal possesses qualified randomness.Table 13
Randomness of the encrypted image analysis.
Test itemsP valueResultsThe frequency (monobit) test0.6035PassFrequency test within a block0.3020PassThe runs test0.3760PassTests for the longest-run-of-ones in a block0.6157PassThe binary matrix rank test0.1485PassThe discrete Fourier transform (spectral) test0.5617PassThe non-overlapping template matching test0.9584PassThe overlapping template matching test0.8423PassMaurer’s “universal statistical” test0.1707PassThe linear complexity test0.5492PassThe serial test0.0835PassThe approximate entropy test0.9292PassThe cumulative sums (cusums) test0.9374PassThe random excursions test0.6948PassThe random excursions variant test0.2333Pass


### 4.11. Graphic Autocorrelation Analysis

Autocorrelation is the correlation of an image with a delayed copy of itself as a function of delay, which is a mathematical tool for finding repeating patterns in signal processing, such as the presence of a periodic signal obscured by noise [55]. Thus, a secure encryption scheme should generate an encrypted image that presents a flat and uniform graphic autocorrelation to avoid bad effect [53]. Following the way presented in [53], we compute, respectively, the graphic autocorrelations of the plain image 5.1.10.tiff and its encrypted image generated by the proposed encryption scheme, which are graphically shown in Figure 13. As can be seen, the graphic autocorrelation to the plain image shows waves and a cone in the center, while the encrypted image is uniformly distributed and shows no visible pattern.Figure 13
Graphic autocorrelation analysis: (a, c) the plain image 5.1.10.tiff and its encrypted image; (b, d) the graphic autocorrelations of (a) and (c).
(a)(b)(c)(d)


### 4.12. Encryption Quality Analysis

Encryption quality is the difference between the frequency of occurrence for each pixel gray level before and after encryption [56], which is defined by(13)EQ=∑i=02L−1oiP−oiC2L,where oiC and oiP are, respectively, the observed occurrence for gray level i in the encrypted image C and L bit plain image P. For L=8 bit plain image, the maximal value of EQ is 510×M×N/2L×2L where M×N is the size of plain image. Thus, the closer to the maximal value, the better the encryption quality of the proposed encryption scheme. Table 14 gives the test values for our cipher algorithm and the compared method. It is clear that our proposed encryption scheme has higher cipher quality than the compared method.Table 14
Encryption quality analysis.
File nameProposedReference [18]5.1.09.tiff302.0781300.60945.1.10.tiff188.8203188.57035.1.11.tiff301.4609301.17975.1.12.tiff242.6406243.68755.1.13.tiff455.1406454.91415.1.14.tiff208.1250205.8203Mean283.0443282.4635


### 4.13. Comparison with Existing Works

The aforementioned analyses demonstrate the performance features of the proposed encryption scheme. However, when it comes to compare with the existing works, it is not easy to make a fair comparison between two encryption schemes because of the adopted test standard and the purpose used in different real scenarios. Nevertheless, we approximately compute some statistical metrics of the encrypted images generated by the proposed encryption scheme and the compared methods presented in [18, 40–42]. For fairness, all the encryption schemes are performed on the same plain image with the equipment described in Section 3.3. Finally, the computed results are listed in Tables 15 and 16, which show that the proposed encryption scheme is comparable with the existing works. In more detail, Table 15 gives the coefficients calculated from the plain image 5.1.10.tiff and the different encrypted images generated by compared methods. Similarly, Table 16 lists the NPCR, UACI, entropy values, LSE values, chi-square values, and EQ values for the different schemes.Table 15
Comparison analysis-I.
AlgorithmDirectionsHorizontalVerticalDiagonal5.1.10.tiff0.90120.85530.8338Reference [40]−0.00400.02270.0050Reference [41]−0.0027−0.01110.0290Reference [18]−0.0138−0.0043−0.0221Reference [42]0.01440.00570.0043Proposed0.0251−0.0228−0.0098Table 16
Comparison analysis-II.
AlgorithmNPCRUACIEntropyLSEχ2EQ5.1.10.tiff——7.31187.0258——Reference [40]99.494933.54377.99727.9034253.8672189.2266Reference [41]99.568233.45637.99727.9041253.6484187.7031Reference [18]99.265833.96857.99767.9039217.4219188.5703Reference [42]99.962533.55577.99737.9023249.4219188.2422Proposed99.626233.47707.99757.9024227.8750188.8203


## 4.1. Histogram Analysis

An image histogram gives the entire intensity value distribution visually in an image [34]. An ideal encryption scheme should be able to generate final encrypted image uniformly distributed. To see this, Figure 7 plots the histograms of plain images 5.1.11.tiff, 5.1.12.tiff, and 5.1.13.tiff, the final encrypted images generated by the proposed encryption scheme, and the corresponding recovered images, respectively. From the figure, one can obviously observe that the histograms of the plain images are statistically significant while the encrypted images are uniformly distributed. Thus, the histogram will not leak any useful information to attackers.Figure 7
Histogram analysis: (a, d, g) the histograms of plain images 5.1.11.tiff, 5.1.12.tiff, and 5.1.13.tiff; (b, e, h) the histograms of the respective encrypted results; (c, f, i) the histograms of the respective recovered images.
(a)(b)(c)(d)(e)(f)(g)(h)(i)In addition, the chi-square test [35] is further applied to quantitatively evaluate the uniformity of the histograms. It is mathematically defined by(6)χtest2=∑v=0255fv−d2d,d=M×N256,where fv is the frequency of each gray level v∈0,1,…,255 for a 8-bit gray-scale image and M×N is the size of the tested image. With a significance level of 0.05, the theoretical chi-square value is χ0.052=293.2478 [35]. A smaller experimental value indicates the more uniform distribution for a specific image histogram. In our proposed test analysis, we randomly selected 6 gray-scale plain images (5.1.09.tiff through 5.1.14.tiff). The corresponding test results are listed in Table 1. Moreover, we also perform the chi-square tests on the scheme presented in [18]. Their test results are also included in Table 1. Based on the mean value and pass rate in the table, we can conclude that proposed encryption scheme provides better performance than the compared algorithm.Table 1
Chi-square test analysis.
File nameχ255,0.052χ2 (proposed)χ2 (reference [18])5.1.09.tiff293.2478251.7578248.85165.1.10.tiff293.2478227.8750217.42195.1.11.tiff293.2478251.4453228.60165.1.12.tiff293.2478276.6172259.81255.1.13.tiff293.2478229.3281362.82035.1.14.tiff293.2478238.1797248.6172Mean293.2478211.6004224.4464Pass rate—6/65/6


## 4.2. Correlation Analysis

The adjacent pixels in a natural image are strongly correlated. A good image encryption scheme should have a low correlation in different adjacent directions [13]. To evaluate the proposed encryption scheme, we randomly select 5000 pairs of pixels of the encrypted image in the horizontal, vertical, and diagonal directions, respectively. Then, the correlation coefficient of each pair, defined in (7), is calculated.(7)Ex=1N∑i=1Nxi,Dx=1N∑i=1Nxi−Ex2,covx,y=1N∑i=1Nxi−Exyi−Ey,rxy=covx,yDx×Dy,where x and y are the adjacent pixel sequences selected from the different directions, N=5000 is the size of the selected pixel sequence, and Ex and Dx are the mean and the standard deviation of x, respectively. If the selected pixel sequences have low correlation, their coefficient calculated by equation (7) should be close to 0. Otherwise, it will be close to 1 [13]. Figure 8 shows the selected pixel sequence distributions in different directions, and Table 2 lists the calculated results where H, V, and D denote the horizontal, vertical, and diagonal directions, respectively. Besides, we also calculate the correlation coefficients for the encrypted image generated by the encryption scheme presented in [18], and the results are also included in Table 2. While the distributions in plain image are close to diagonal line, the distributions in the encrypted image are randomly scattered. Similarly, the quantitative results in plain image are close to 1 while the resulting values in the encrypted image are close to 0. Therefore, both figures and tables show that the plain image has strong relationships but that weakness exists in the encrypted image. Furthermore, in most cases, the proposed encryption scheme outperforms the compared method. From the above analysis, we infer that our proposed encryption scheme can efficiently eliminate the strong correlation of the adjacent pixels.Figure 8
Correlation analysis: (a, c, e) the pixel sequence distributions of the plain image 5.1.12.tiff in the horizontal, vertical, and diagonal directions, respectively; (b, d, f) the pixel distributions of the corresponding encrypted image in the horizontal, vertical, and diagonal directions.
(a)(b)(c)(d)(e)(f)Table 2
Correlation analysis.
File nameDirectionsPlain imageProposedReference [18]5.1.09.tiffH0.9051−0.0062−0.0109V0.94170.0278−0.0067D0.90780.0061−0.00895.1.10.tiffH0.90120.0251−0.0138V0.8553−0.0228−0.0043D0.8338−0.0098−0.02215.1.11.tiffH0.95920.0307−0.0133V0.9419−0.02500.0121D0.8878−0.0261−0.00425.1.12.tiffH0.9538−0.0031−0.0059V0.9747−0.0196−0.0148D0.9327−0.01100.00725.1.13.tiffH0.8762−0.01850.0102V0.85970.0043−0.0104D0.75370.0219−0.00925.1.14.tiffH0.94770.00590.0122V0.9009−0.0149−0.0227D0.84780.0094−0.0073


## 4.3. Information Entropy Analysis

Information entropy measures the randomness and unpredictability of a random sequencek [36]. It is defined by(8)Hk=−∑i=02L−1Pkilog2Pki,where Pki, i∈0,1,…,2L−1, denotes the probability of the ith symbol ki. The ideal entropy value for an image with 28 gray levels should be 8 [37]. We randomly test 6 plain images (5.1.09.tiff through 5.1.14.tiff) from the USC-SIPI Image Database. The calculated results of the encrypted images generated by the proposed encryption scheme and the method presented in [18] are listed in Table 3. From the mean value results, we deduce that the proposed encryption scheme provides better randomness. Moreover, the local Shannon entropy (LSE) is adopted to evaluate the randomness of an image from local view [38]. It is computed by(9)H¯k,TBm=∑i=1kHSik,where k is the total number of selected nonoverlapping image block Si and TB is noted as the number of pixel in each block. With the significance level α=0.05 and the parameters k,TB=30,1936, the theoretical LSE interval is 7.9019,7.9030 for a 8-bit image [38]. To see our proposal, Table 4 gives the LSE values for the proposed method and the compared algorithm presented in [18]. It is obvious that the LSE values of the encrypted images obtained by our proposal are in the theoretical interval, and most of the results are bigger than the compared algorithm, which means that the proposed method has better randomness in terms of local view.Table 3
Information entropy analysis.
File namePlain imageProposedReference [18]5.1.09.tiff6.70937.99727.99735.1.10.tiff7.31187.99757.99765.1.11.tiff6.45237.99727.99755.1.12.tiff6.70577.99697.99715.1.13.tiff1.54837.99757.99605.1.14.tiff7.34247.99747.9973Mean6.01167.99737.9971Table 4
Local Shannon entropy (LSE) analysis.
File namePlain imageProposedReference [18]5.1.09.tiff6.20337.90477.90065.1.10.tiff7.02587.90247.90395.1.11.tiff5.20507.90527.90345.1.12.tiff5.18677.90267.90195.1.13.tiff1.47657.90477.90145.1.14.tiff6.68187.90367.9043Mean5.29657.90397.9026


## 4.4. Key Space Analysis

Key space is composed of all possible secret keys. Specifically, the key space of a high security encryption scheme should larger than2100 to counter brute force attack [39]. In our proposed encryption scheme, the key space is generated by a 256 random bit string, which is large enough to satisfy the standard requirement. Moreover, Table 5 lists the key spaces of five schemes. It is clear that the proposed encryption scheme can resist the brute force attack and can be comparable with the methods proposed in [18, 40–42].Table 5
Key space analysis.
AlgorithmReference [40]Reference [41]Reference [18]Reference [42]ProposedKey size2256229921992384×10382256


## 4.5. Key Sensitivity Analysis

The key sensitivity means that a slight disturbance of the secret key should generate a totally different result in both the encryption and decryption processes [43]. For a strong robust encryption scheme, it should be extremely sensitive to its secret key variations. The two-dimensional correlation coefficient cAB between two random images A, B is adopted to examine the key sensitivity, which is defined as(10)A¯=1H×W∑i=1H∑j=1WAi,j,B¯=1H×W∑i=1H∑j=1WBi,j,covAB=1H×W∑i=1H∑i=1WAi,j−A¯Bi,j−B¯,DA=1H×W∑i=1H∑j=1WAi,j−A¯,DB=1H×W∑i=1H∑j=1WBi,j−B¯,cAB=covABDA×DB,where H×W is the size of the tested image. Generally, the smaller the coefficient value, the lower correlation between two random images [14, 44].In our proposed key sensitivity analysis, we first randomly generate a 256-bit secretKey. To obtain two new keys with only 1-bit difference, which are denoted as Keyii=1,2, respectively, we repeatedly change one bit of Key two times. We then perform the proposed encryption scheme with Key and Keyi on the plain image 5.1.13.tiff to get the respective encrypted images C and Cii=1,2. The different cipher images are shown in Figure 9, which also plots the differences C−Cii=1,2. As can be seen, the encrypted images generated by the keys with slight difference are completely different. Additionally, we calculate the respective two-dimensional correlation coefficients between C and Ci. Table 6 gives the calculated results which are close to 0. Hence, the proposed encryption scheme is sensitive to its secret key in the cipher process.Figure 9
Encryption key sensitivity analysis: (a) the cipher imageC; (b, d) the cipher images Cii=1,2; (c, e) the differences C−Cii=1,2.
(a)(b)(c)(d)(e)Table 6
Encryption key sensitivity analysis.
C1C2C−0.0060−2.1728e − 04For the decryption analysis process, we decipherC with Key and Kii=1,2 to obtain the recovered images D and Di, respectively. The different decipher results are shown in Figure 10, which also plots the differences D−Dii=1,2. Moreover, the correlation coefficients between D and Di are listed in Table 7. From the figure and table, one can see that the proposed encryption scheme is sensitive to its secret key in the decipher process. Combining the aforementioned encryption key sensitivity analysis, we conclude that the proposed image encryption scheme is extremely sensitive to secret key.Figure 10
Decryption key sensitivity analysis: (a) the recovered imageD; (b, d) the recovered images Dii=1,2; (c, e) the differences D−Dii=1,2.
(a)(b)(c)(d)(e)Table 7
Decryption key sensitivity analysis.
D1D2D0.00140.0040


## 4.6. Noise and Data Loss Attack Analysis

Traditionally, when an encrypted image is transmitted through an unsecure network or stored in physical medias, it is easy to surfer from the noise perturbation or the data loss. So, a strong robust image encryption scheme should have the ability to minimize the bad effect caused by the noise perturbation and the data loss [45]. In our proposed analysis, we adopt peak signal-to-noise ratio (PSNR) to measure the quality of the reconstruction [46, 47]. Given a gray-scale image I1 with size of M×N and its noisy approximation I2, it is defined as(11)MSE=1M×N∑i=1M∑j=1NI1i,j−I2i,j2,PSNR=10×log10255×255MSEdB,where MSE denotes the mean square error between I1 and I2. Typical values for the PSNR in lossy image compression are between 30 dB and 50 dB, provided the bit depth is 8 bits, where the higher is better [48]. We perform the proposed encryption scheme on plain image 5.1.10.tiff to generate the encrypted image. Then, we add salt and pepper noises (SPNs) to the encrypted image with 0.01,0.02,and0.03 densities, respectively. As a result, Figure 11 plots these noisy results and their recovered images, respectively. As can be seen, the recovered images are visually recognizable. Moreover, Table 8 lists the PSNR (in dB) values which indicates that the proposed encryption scheme can resist noise affect. It also shows the results computed by the compared algorithms presented in [18, 40–42]. Clearly, our proposal can be comparable with the recent works. Likewise, the Gaussian white noise with constant mean and different variances is also applied to evaluate the ability of resisting noise attack. The tested results are given in Table 9 which carries out that our proposal can also resist the Gaussian white noise.Figure 11
Noise attack analysis: (a, b, c) the noisy encrypted images by SPN with0.01,0.03,and0.05 densities; (d, e, f) the deciphered images of (a), (b), and (c).
(a)(b)(c)(d)(e)(f)Table 8
Noise attack analysis-I (dB).
Noise density0.010.030.05Proposed32.821830.787129.9716Reference [18]28.692328.693728.7211Reference [40]28.704428.707128.6974Reference [41]32.562229.954329.7082Reference [42]30.217329.449429.3079Table 9
Noise attack analysis-II (dB).
Variances0.000010.000050.0007Proposed28.712128.701928.6937Reference [18]28.711328.700028.7132Reference [40]28.711328.720728.6930Reference [41]28.711428.708028.7246Reference [42]28.711428.725928.7147Similarly, we perform the occlusion attack analysis. Figure12 shows the loss results by cutting 1/8,1/8,and1/4 of the encrypted image. On the other hand, Table 10 gives the PSNR values between the plain image and the reconstructed results. Both figure and table demonstrate that our proposed encryption scheme can offer cutting resistance. Combining with above noise attack analysis, we infer that the proposed encryption scheme provides resistance against noise and data loss effects.Figure 12
Data loss analysis: (a, b, c) the loss results by cutting1/8,1/8,and1/4 of the encrypted image; (d, e, f) the deciphered images of (a), (b), and (c).
(a)(b)(c)(d)(e)(f)Table 10
Data loss analysis (dB).
Loss rate1/81/81/4Proposed32.149232.377329.8749Reference [18]28.695328.703128.7158Reference [40]28.699728.693928.6945Reference [41]30.964330.936830.9225Reference [42]34.846833.436233.4350


## 4.7. Differential Attack Analysis

The differential attack analysis is referred to how tiny change in the plain image can influence the encrypted image. More specifically, the invader can make a slight change in the plain image, and then examine their encryption difference, which aims to get the information about the secret key. Therefore, a high-level security encryption scheme should withstand this kind of attack [29, 49]. The number of pixels change rate (NPCR) and the unified average changing intensity (UACI), defined in equation (12), are used to numerically evaluate the ability to resist differential attack.(12)NPCR=∑i,jDi,jM×N×100%,UACI=1M×N∑i,jC1i,j−C2i,j255×100%,where C1i,j and C2i,j, i∈1,…,M, j∈1,…,N, are, respectively, two encrypted images whose plain images have only 1-bit difference. Di,j=1 if C1i,j≠C2i,j; otherwise, Di,j=0. M×N is the size of plain image. With the significance level α=0.05, the theoretical NPCR value is 99.5693% for an image of size 256×256. For the UACI, its ideal interval is 33.2824%,33.6447% [1]. The closer to the theoretical value or interval, the stronger the ability to resist the differential attack.In the proposed analysis, we randomly choose one pixel in six plain images and change its value by 1-bit to generate changed six plain images. They are then encrypted by the proposed encryption scheme and the method presented in [18] to obtain the corresponding encrypted images. Finally, the NPCR and UACI values between these results are listed in Table 11. This indicates that the proposed scheme has qualified performance to resist differential attack in the statistical sense.Table 11
Differential attack analysis (%).
Test imageNPCRUACIProposedReference [18]ProposedReference [18]5.1.09.tiff99.575830.452433.618111.17305.1.10.tiff99.609472.084033.338324.38935.1.11.tiff99.630791.113333.602637.89875.1.12.tiff99.568283.525133.351433.38995.1.13.tiff99.578992.404233.281231.06405.1.14.tiff99.620198.559633.473832.8520Average99.597278.356433.444228.4612


## 4.8. Chosen Plain Image and Known Plain Image Attack Analysis

Security against chosen plain image attack means that the attacker cannot tell which of these two possible plain images were encrypted with probability significantly better than random guessing [50]. In the proposed encryption scheme, we adopt a bit-level circularly shift operation on plain image in the permutation phase. As a result, different encrypted images will be generated by a slightly changed plain image. In addition, chaos-based pseudo-random sequences are further employed to diffuse the permuted image. Therefore, the proposed encryption scheme could successfully resist the chosen plain image and known plain image attack.


## 4.9. Time Complexity Analysis

The time complexity measures the amount of time taken by an encryption scheme to run as a function of the size of plain image [51–53]. Clearly, the lower the value of running time, the higher the efficiency. However, a complete comparison would be unfair due to the incommensurable difference in terms of the programming skills and the equipment adopted for testing. Nevertheless, in order to evaluate the proposed encryption scheme, Table 12 lists the one round running times on the same platform and the same plain images (5.1.10.tiff (256×256), 5.1.08.tiff (512×512), and 5.3.01.tiff (1024×1024)) for our proposal and the compared algorithms presented in [18, 40–42]. On the other hand, one can learn that the computational cost of the proposed encryption scheme is O(MN) with the big-O notation, where M and N represent the size of the plain image in pixels. It is clear that the proposed scheme can be comparable with the existing algorithms.Table 12
Time complexity analysis (second).
Image sizeReference [40]Reference [41]Reference [18]Reference [42]Proposed256×2560.02820.47621.499318.44541.0196512×5120.04371.38435.956873.01983.99241024×10240.17855.564023.9620291.604716.0123


## 4.10. Randomness of the Encrypted Image Analysis

In this section, the National Institute of Standards and Technology (NIST) 800.22 statistical test suite is adopted for the randomness test of the encrypted image generated by the proposed encryption scheme. The test results for plain image 5.1.12.tiff are listed in Table13. Clearly, each P value corresponding to a particular test is bigger than 0.01 [54]. Hence, the acquired encrypted image can pass all the NIST 800.22 statistical tests at the 1% level of significance, which implies that the encrypted image generated by our proposal possesses qualified randomness.Table 13
Randomness of the encrypted image analysis.
Test itemsP valueResultsThe frequency (monobit) test0.6035PassFrequency test within a block0.3020PassThe runs test0.3760PassTests for the longest-run-of-ones in a block0.6157PassThe binary matrix rank test0.1485PassThe discrete Fourier transform (spectral) test0.5617PassThe non-overlapping template matching test0.9584PassThe overlapping template matching test0.8423PassMaurer’s “universal statistical” test0.1707PassThe linear complexity test0.5492PassThe serial test0.0835PassThe approximate entropy test0.9292PassThe cumulative sums (cusums) test0.9374PassThe random excursions test0.6948PassThe random excursions variant test0.2333Pass


## 4.11. Graphic Autocorrelation Analysis

Autocorrelation is the correlation of an image with a delayed copy of itself as a function of delay, which is a mathematical tool for finding repeating patterns in signal processing, such as the presence of a periodic signal obscured by noise [55]. Thus, a secure encryption scheme should generate an encrypted image that presents a flat and uniform graphic autocorrelation to avoid bad effect [53]. Following the way presented in [53], we compute, respectively, the graphic autocorrelations of the plain image 5.1.10.tiff and its encrypted image generated by the proposed encryption scheme, which are graphically shown in Figure 13. As can be seen, the graphic autocorrelation to the plain image shows waves and a cone in the center, while the encrypted image is uniformly distributed and shows no visible pattern.Figure 13
Graphic autocorrelation analysis: (a, c) the plain image 5.1.10.tiff and its encrypted image; (b, d) the graphic autocorrelations of (a) and (c).
(a)(b)(c)(d)


## 4.12. Encryption Quality Analysis

Encryption quality is the difference between the frequency of occurrence for each pixel gray level before and after encryption [56], which is defined by(13)EQ=∑i=02L−1oiP−oiC2L,where oiC and oiP are, respectively, the observed occurrence for gray level i in the encrypted image C and L bit plain image P. For L=8 bit plain image, the maximal value of EQ is 510×M×N/2L×2L where M×N is the size of plain image. Thus, the closer to the maximal value, the better the encryption quality of the proposed encryption scheme. Table 14 gives the test values for our cipher algorithm and the compared method. It is clear that our proposed encryption scheme has higher cipher quality than the compared method.Table 14
Encryption quality analysis.
File nameProposedReference [18]5.1.09.tiff302.0781300.60945.1.10.tiff188.8203188.57035.1.11.tiff301.4609301.17975.1.12.tiff242.6406243.68755.1.13.tiff455.1406454.91415.1.14.tiff208.1250205.8203Mean283.0443282.4635


## 4.13. Comparison with Existing Works

The aforementioned analyses demonstrate the performance features of the proposed encryption scheme. However, when it comes to compare with the existing works, it is not easy to make a fair comparison between two encryption schemes because of the adopted test standard and the purpose used in different real scenarios. Nevertheless, we approximately compute some statistical metrics of the encrypted images generated by the proposed encryption scheme and the compared methods presented in [18, 40–42]. For fairness, all the encryption schemes are performed on the same plain image with the equipment described in Section 3.3. Finally, the computed results are listed in Tables 15 and 16, which show that the proposed encryption scheme is comparable with the existing works. In more detail, Table 15 gives the coefficients calculated from the plain image 5.1.10.tiff and the different encrypted images generated by compared methods. Similarly, Table 16 lists the NPCR, UACI, entropy values, LSE values, chi-square values, and EQ values for the different schemes.Table 15
Comparison analysis-I.
AlgorithmDirectionsHorizontalVerticalDiagonal5.1.10.tiff0.90120.85530.8338Reference [40]−0.00400.02270.0050Reference [41]−0.0027−0.01110.0290Reference [18]−0.0138−0.0043−0.0221Reference [42]0.01440.00570.0043Proposed0.0251−0.0228−0.0098Table 16
Comparison analysis-II.
AlgorithmNPCRUACIEntropyLSEχ2EQ5.1.10.tiff——7.31187.0258——Reference [40]99.494933.54377.99727.9034253.8672189.2266Reference [41]99.568233.45637.99727.9041253.6484187.7031Reference [18]99.265833.96857.99767.9039217.4219188.5703Reference [42]99.962533.55577.99737.9023249.4219188.2422Proposed99.626233.47707.99757.9024227.8750188.8203


## 5. Conclusion

This paper proposes a novel image encryption scheme based on the PWLCM and the standard map, which adopts the well-known permutation-diffusion structure. Different from the traditional pixel-level scrambling way, a hierarchical diffusion process, which not only changes the pixel position but also modifies the pixel value, is employed in the permutation phase. In the pixel diffusion process, the row-by-row and column-by-column operation model is further applied to enhance efficiency. The simulations and performance analyses imply that the proposed scheme may achieve a better trade-off between security and efficiency than other state-of-the-art encryption schemes. Moreover, the proposed encryption scheme provides a good flexibility since it supports any size of plain gray-scale image or color image. More specifically, when it comes to color image, we first reshape the 3-dimensional plain image to the 2-dimensional one from the top to bottom and left to right and then process it with the proposed encryption scheme to generate the final encrypted image. Furthermore, the proposed encryption scheme can achieve more simplicity than other advanced works due to the fact that it only uses the iterative substitution-permutation architecture. In addition, this work can promote the practical application of the nonlinear dynamic system. In the future, to further evaluate the security, we will try to give a rigorously mathematical proof like the conventional cryptography did. On the other hand, to see a higher efficiency, we will implement the proposed encryption scheme using parallel computing.



---

*Source: 3026972-2020-12-24.xml*