• No results found

Analysis and Improvement of Image Encryption Algorithm Based Translation Chaotic System

N/A
N/A
Protected

Academic year: 2020

Share "Analysis and Improvement of Image Encryption Algorithm Based Translation Chaotic System"

Copied!
5
0
0

Loading.... (view fulltext now)

Full text

(1)

2018 2nd International Conference on Applied Mathematics, Modeling and Simulation (AMMS 2018) ISBN: 978-1-60595-580-3

Analysis and Improvement of Image Encryption Algorithm Based

Translation Chaotic System

Yue LIU

*

College of Electrical and Electronic Engineering, Changchun University of Technology, Changchun 130012, China

*Corresponding author

Keywords: Translation chaotic system, Image encryption and decryption, Cryptographic system.

Abstract. In this paper, we propose and improvement the translation chaotic system is applied to the field of image encryption and decryption, which is analyzed for Lena image. For the cryptographic system studied, firstly, the row and column of the image are used to map the correlation between pixels by Logistic mapping. Secondly, we use the translation chaotic system to mix the structure and pixel of the image to generate the key stream. Finally, the simulation results show that the encryption part proposed in this paper can be completed without knowing anything about the image key. In the decryption section, we only need to know the initial value set in the encryption system to completely crack the encryption system.

Introduction

In recent years, the security of digital images has attracted much attention in computer communication and network engineering [1,2]. Since Mathews, a British scholar, first proposed the "chaotic cipher" in 1989, many scholars had studied the close relationship between chaos and cryptography, such as Logistic [3], Arnold cat [4,5], Chebyshev and Henon mapping, and others algorithms, which based on some mathematical transformations[6-11]. Jessica Fridrich, the first person, whom applied chaos theory to image encryption, in 1997 [3]. In 2005, Z Guan and fellows proposed a new encryption algorithm based on Arnold cat mapping [4,5]. In 2009, Xiao D and fellows analysis and improvement it[5]. In the same year, Cahit Cokal and et al analyzed the security of this algorithm [4]. In 2008, R Rhouma and B Safya first applied Logistic mapping to hyperchaotic systems [2,3]. In 2009, K Wong pointed out that an existing image encryption system based on chaos includes two stages: substitution and diffusion. The multi-dimensional chaotic mapping usually uses the image pixel arrangement in the alternative phase, and the one-dimensional (1D) chaotic mapping is used for the purpose of diffusion, and an efficient chaotic image encryption and diffusion method is proposed [6]. In 2010, Narendra Singh and Aloka Sinha proposed Chaos based multiple image encryptions using multiple canonical transforms [7]. In the same year, Lang J and others proposed image encryption based on the multiple-parameter discrete fractional Fourier transform and chaos function [8], and so on. The results on chaos have also obtained. That is, the translation-type chaotic systems were proposed [12,13] by Liu in 2016.

Inspired by previous works and used the unique properties of this chaotic system, which can be related to the cryptography that has the character of "chaos" and "diffusion". Therefore, it is a natural idea to enrich the design of new cryptographic schemes based chaos. And so far, many applications have been put forward in the field of chaotic ciphers, especially the direction of image encryption. Undoubtedly these results will improve this chaotic system application value in the image encryption and cryptographic system.

(2)

Image Encryption Algorithmic

This encryption scheme consists of two parts: (1) the encryption based on the overall reset of the image pixel matrix; (2) using the translation chaotic system to form a key stream, which can be embedded in the pixel image.

Firstly, consider the image with a size of N × M, which is represented by Pi,j (i = 0, . . . ,M-1j =

0, . . . , N-1). ByLogistic mapping, the initial condition is x0

xn+1 = 4xn(1 − xn) (1)

Then, after a series of n iterations, the final state xn is obtained. Further, set xn to the new x0 and hi

as follows

hi = mod(x0 ×1014, M) (2)

That is the iterative process of Logistic maps. Until the group M different data (0 ~ M – 1) were obtained, namely hi , i = 0, . . . ,M −1. Subsequently, rearranged each rows of the number of pixels

P, that is {hi , i = 0, . . . ,M − 1}, where hi indicates ith after disturbance, as Ph. Then, each column

of the Ph is rearranged in the same way to get a comprehensive reset of the pixel matrix of the image, which is called mixed images, as Phl. The following equation is used to calculate the pixel location of each row of the mixed column.

li,j = mod( x0 ×1014, N ) (3)

where, each column is i = 1, . . . ,M, each row is j = 1, . . . , Nli,j ϵ[0,N-1].

Secondly, the translation chaotic system is described as follows

                                    1 sgn 1 sgn 2 1 9 . 1 1 . 0 2 -1 sgn 1 sgn 2 3 2 1 3 2 1 3 2 3 3 2 1 3 2 1 3 2 3 1 1 x x x x x x x x x x x x x x x x x x x x (4)

The encryption scheme is based on the combination of the state variables of the image pixels and this chaotic system. The steps are as follows:

(1) The system (4) is iterated N0th time.

(2) Generated three variables from the chaotic system and transformed them into integers.

xi=mod( ( |x0|-Floor(|x0| ) )×1014,256 ) (5)

(3) 1

x are generated as follows

) 3 , mod( 1 1 x x   (6)

Based on the value of 1

x , according (5), three variables (B1B2B3) are selected from three

variables (X1X2X3) to perform the encryption operation. Then, three key streams are defined,

namely BKk = 12,3,as follows:

(3)

where Pi and Ci , i = 1, 2, . . . , N×M, representing the reset image Phl and the encrypted image,

respectively.

(4) Continued iterate the chaotic system and repeat steps (2) until the whole image is completely encrypted. The process of decryption is to decrypt the encrypted image of the chaotic system by using the same parameters and initial values. And then the image is generated by anti-shuffling, and the decrypted image can be obtained.

Simulation

[image:3.595.68.528.286.547.2]

In this section, the proposed image encryption algorithm is applied to the Lena image. The original image as shown in Fig.1(a), the size is 256 ×256. which is processed in the following order: Image gray-scale processing as shown in Fig.1(b); Image approximation of the original image as shown in Fig.1(c) and then, the low frequency , the low frequency vertical and the high frequency of the original image are extracted as shown in Fig.1(d)~ (f); Finally, The histogram as shown in Fig.1(g).

Figure 1.Original image and its processing: (a) Original image; (b) Gray-scale processing; (c) Image approximation; (d) Low Frequency; (e) Low frequency Vertical; (f) High Frequency; (g) Histogram.

The encrypted image is shown in Fig.2 (a). The histogram as shown in Fig.2 (b). And then, the encrypted image is reconstructed by wavelet, and the reconstructed image is shown in Fig.2 (c)

Figure 2. The encrypted image and its processing: (a) Histogram; (b) Encrypted image is reconstructed by wavelet; (c) Reconstructed image.

0 200 400 600 800 1000 1200

加 密 之 后 的 直 方图

0 50 100 150 200 250

加 密图 像 小 波 重 构

(a) (b) (c) (d)

图 像 近 似 低频 水 平 分 量

低频 垂 直 分 量 高频 分 量

原 始图 像 灰 度 化处 理

(b) (a)

图 像 近 似 低频 水 平 分 量

低频 垂 直 分 量 高频 分 量

(c)

图 像 近 似 低频 水 平 分 量

低频 垂 直 分 量 高频 分 量

(e)

图 像 近 似 低频 水 平 分 量

低频 垂 直 分 量 高频 分 量

(f)

0 200 400 600 800 1000 1200

初 始图 像 的 直 方 图

0 50 100 150 200 250

[image:3.595.92.525.623.751.2]
(4)

When the encrypted image is decrypted, the same parameters and initial values are selected. First, the decrypted wavelet reconstruction is performed on the encrypted image, as shown in Fig.3 (a); the histogram as shown in Fig.3 (b); then, the anti-shuffle produces decryption images, as shown in Fig.3 (c); if the decryption method is incorrect, the decryption is not successful, as shown in Fig.3 (d).

[image:4.595.62.537.197.326.2]

As we can see from Fig.3, if the same parameters and initial values are selected, decryption image could be obtained. However, even if the same algorithm, if the different value are chosen, the decryption image could not be obtained.

Figure 3. The decrypted image and its processing:(a) Gray-scale processing; (b) Histogram; (c) Anti-shuffle produces; (d)Different parameters and initial values are selected.

Summary

In this paper, image encryption algorithm are analyzed and improvement based the translation chaotic system. Firstly, four steps of this algorithm introduced in detail. Then, this algorithm is applied to Lena image, which information are extracted. Finally, the simulation results shown that the encryption can be completed decryption without anything about image key. And then, the decryption process, the same parameters and initial values must be selected as the key stream, otherwise failed.

References

[1] J Wu, X Cao, R Molina. Cryptography: Theory and practice: By Douglas R. Stinson. CRC Press, Boca Raton, 1995.

[2] T Gao, Z Chen. A new image encryption algorithm based on hyper-chaos. Physics Letters A, 372 (2008) 394-400.

[3] R Rhouma, B Safya. Cryptanalysis of a new image encryption algorithm based on hyper-chaos. Physics Letters A, 372(2008)5973-5978.

[4] C Cahit, S Ercan. Cryptanalysis of a chaos-based image encryption algorithm. Physics Letters A, 373(2009)1357-13604.

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

[6] K Wong, B Kwok, C Yuen. An efficient diffusion approach for chaos-based image encryption. Chaos, Solitons & Fractals, 41(2009) 2652-2663.

[7] S Narendra, S Aloka. Chaos based multiple image encryption using multiple canonical transforms. Optics & Laser Technology, 42(2010) 724-731.

解 密图 像 小 波 重 构

(a)

0 200 400 600 800 1000 1200

解 密 之 后 的 直 方图

0 50 100 150 200 250

(5)

[8] J Lang, R Tao, Y Wang. Image encryption based on the multiple-parameter discrete fractional Fourier transform and chaos function. Optics Communications, 283(2010)2092-2096.

[9] N Zhou, Y Wang, L Gong. Novel single-channel color image encryption algorithm based on chaos and fractional Fourier transform. Optics Communications, 284(2011)2789-2796.

[10] Y Wang, K Wong, X Liao. A new chaos-based fast image encryption algorithm. Applied Soft Computing, 11(2011)514-522.

[11] C Yuen, K Wong. A chaos-based joint image compression and encryption scheme using DCT and SHA-1. Applied Soft Computing, 11(2011) 5092- 5098.

[12] Y Liu, J Guan, C.M Yang. Generation of 2N+1-scroll existence in new three-dimensional chaos systems, Chaos.26 (2016)084307.

Figure

Fig.1(g).  of the original image are extracted as shown in Fig.1(d)~ (f); Finally, The histogram as shown in 图 像 近 似
Figure 3. The decrypted image and its processing:(a) Gray-scale processing; (b) Histogram; (c) Anti-shuffle produces; (d) Different parameters and initial values are selected

References

Related documents

Sea ice in Mc- Murdo Sound is atypical of Antarctic pack ice, so improved understanding of the CS-2 freeboard measurement over vary- ing snow and sea ice conditions in open water

Figure 4 The ratio of Treg cells to Th17 cells negatively correlated with total bilirubin levels in chronic HBV-infected patients, especially in patients with ACHBLF (B) and

Driving need, initial event rate, fraction of events per- ceived as risky, event decay time, effect of recent events on monthly driving, effect of recent events on events per mile,

The aim of this study is to determine the impact of a community-based intervention delivered by nursing students on health-related quality of life (HRQoL) and perceived social

Table 3 and Fig. 4 illustrate the temporal evolution of the different networks at the term level. The communication networks aggregated in the second and third terms are very

ence; RR: Relative risk; RCT : Randomized controlled trial; RRT : Renal replace- ment therapy; RBCs: Red blood cells; TSA: Trial sequential analysis; RIFLE: Risk, injury, failure,

Thus, these data suggest that increased Ras/ MAPK signaling observed in alph mutant backgrounds is not responsible for the regulatory role that Alph plays in SAPK signaling, although

An analytic center cutting plane method for solving semi-infinite variational inequality problems. Merit functions for complementarity and related prob- lems: