scholarly journals A Novel Image-Encryption Scheme Based on a Non-Linear Cross-Coupled Hyperchaotic System with the Dynamic Correlation of Plaintext Pixels

Entropy ◽  
2020 ◽  
Vol 22 (7) ◽  
pp. 779
Author(s):  
Wenjin Hou ◽  
Shouliang Li ◽  
Jiapeng He ◽  
Yide Ma
Keyword(s):  
Image Encryption ◽  
Logistic Map ◽  
Chaotic Sequence ◽  
Hyperchaotic System ◽  
Dynamic Correlation ◽  
Non Linear ◽  
Diffusion Phase ◽  
Image Pixels ◽  
Differential Attacks ◽  
Image Encryption Algorithm

Based on a logistic map and Feigenbaum map, we proposed a logistic Feigenbaum non-linear cross-coupled hyperchaotic map (LF-NCHM) model. Experimental verification showed that the system is a hyperchaotic system. Compared with the existing cross-coupled mapping, LF-NCHM demonstrated a wider hyperchaotic range, better ergodicity and richer dynamic behavior. A hyperchaotic sequence with the same number of image pixels was generated by LF-NCHM, and a novel image-encryption algorithm with permutation that is dynamically related to plaintext pixels was proposed. In the scrambling stage, the position of the first scrambled pixel was related to the sum of the plaintext pixel values, and the positions of the remaining scrambled pixels were related to the pixel values after the previous scrambling. The scrambling operation also had a certain diffusion effect. In the diffusion phase, using the same chaotic sequence as in the scrambling stage increased the usage rate of the hyperchaotic sequence and improved the calculation efficiency of the algorithm. A large number of experimental simulations and cryptanalyses were performed, and the results proved that the algorithm had outstanding security and extremely high encryption efficiency. In addition, LF-NCHM could effectively resist statistical analysis attacks, differential attacks and chosen-plaintext attacks.

scholarly journals An Image Encryption Algorithm with Total Diffusion

2018 ◽  
Vol 11 (1) ◽  
pp. 15-25
Author(s):  
Jakub Oravec ◽  
Ján Turán ◽  
Ľuboš Ovseník
Keyword(s):  
Image Encryption ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Diffusion Stage ◽  
Suitable Combination ◽  
Image Pixels ◽  
Encrypted Images ◽  
Two Stages ◽  
Image Encryption Algorithm ◽  
Chaotic Logistic Map

Abstract This paper proposes an image encryption algorithm which uses four scans of an image during the diffusion stage in order to achieve total diffusion between intensities of image pixels. The condition of total diffusion is fulfilled by a suitable combination of techniques of ciphertext chaining and plaintext related diffusion. The proposed encryption algorithm uses two stages which utilize chaotic logistic map for generation of pseudo-random sequences. The paper also briefly analyzes approaches described by other researchers and evaluates experimental results of the proposed solution by means of commonly used measures. Properties of our proposal regarding modifications of plain images prior to encryption or modifications of encrypted images prior to decryption are illustrated by two additional experiments. The obtained numeric results are compared with those achieved by other proposals and briefly discussed.

scholarly journals A new secure image encryption algorithm based on a 5D hyperchaotic map

PLoS ONE ◽  
2020 ◽  
Vol 15 (11) ◽  
pp. e0242110
Author(s):  
Dejian Fang ◽  
Shuliang Sun
Keyword(s):  
Image Encryption ◽  
Secure Communication ◽  
Dimensional System ◽  
Hyperchaotic System ◽  
Key Space ◽  
Number Sequences ◽  
Low Dimensional ◽  
Encryption Method ◽  
Differential Attacks ◽  
Image Encryption Algorithm

Image encryption is an effective method for protecting private images during communication. In this paper, a novel image encryption method is proposed based on a 5D hyperchaotic system. Since a 5D hyperchaotic system can generate more complex dynamic behavior than a low-dimensional system, it is used in this paper to generate pseudorandom number sequences. The generated sequences are processed to obtain new sequences. The randomness of the new sequences is improved by recombination and rearrangement. The experimental results and theoretical analysis show that the method possesses a large key space and can resist differential attacks, statistical analysis, entropy analysis, clipping attacks and noise attacks. Therefore, it is very secure and can be used for secure communication.

scholarly journals A Nonlinearly Modulated Logistic Map With Delay for Image Encryption

Electronics ◽  
2018 ◽  
Vol 7 (11) ◽  
pp. 326 ◽  
Author(s):  
Shouliang Li ◽  
Benshun Yin ◽  
Weikang Ding ◽  
Tongfeng Zhang ◽  
Yide Ma
Keyword(s):  
Lyapunov Exponents ◽  
Image Encryption ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Logistic Map ◽  
Delay Model ◽  
Test Results ◽  
Bit Plane ◽  
Differential Attacks ◽  
Image Encryption Algorithm

Considering that a majority of the traditional one-dimensional discrete chaotic maps have disadvantages including a relatively narrow chaotic range, smaller Lyapunov exponents, and excessive periodic windows, a new nonlinearly modulated Logistic map with delay model (NMLD) is proposed. Accordingly, a chaotic map called a first-order Feigenbaum-Logistic NMLD (FL-NMLD) is proposed. Simulation results demonstrate that FL-NMLD has a considerably wider chaotic range, larger Lyapunov exponents, and superior ergodicity compared with existing chaotic maps. Based on FL-NMLD, we propose a new image encryption algorithm that joins the pixel plane and bit-plane shuffle (JPB). The simulation and test results confirm that JPB has higher security than simple pixel-plane encryption and is faster than simple bit-plane encryption. Moreover, it can resist the majority of attacks including statistical and differential attacks.

scholarly journals An image encryption scheme employing key related skipping

2018 ◽  
Vol 69 (2) ◽  
pp. 93-105 ◽  
Author(s):  
Jakub Oravec ◽  
Ján Turán ◽  
L’uboš Ovseník ◽  
Tomáš Huszaník
Keyword(s):  
Phase Space ◽  
Image Encryption ◽  
Statistical Tests ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Encryption Scheme ◽  
Image Pixels ◽  
Encrypted Images ◽  
Image Encryption Algorithm ◽  
Chaotic Logistic Map

Abstract This paper describes an image encryption algorithm which utilizes chaotic logistic map. Values generated by this map are used in two steps of algorithm which shuffles image pixels and then changes their intensities. Design of the encryption scheme considers possibility of various attacks, such as statistical, differential or phase space reconstruction attacks. Robustness against last mentioned type of attacks is introduced by selective skipping of values generated by the map. This skipping depends on key entered by user. The paper also verifies properties of proposed algorithm by common measures and by set of statistical tests that examine randomness of computed encrypted images. Results are compared with other approaches and they are also briefly discussed.

scholarly journals An Image Encryption Algorithm Based on the Improved Sine-Tent Map

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Zijing Gao ◽  
Zeyu Liu ◽  
Lichan Wang
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Encryption Algorithm ◽  
Tent Map ◽  
Initial Sensitivity ◽  
Strong Robustness ◽  
Sine Map ◽  
Image Pixels ◽  
Differential Attacks ◽  
Image Encryption Algorithm

This paper makes use of the characteristics of initial sensitivity and randomness of the chaotic map to design an image encryption algorithm based on the sine map and the tent map. The sine map is used to improve the tent map; then, the improved sine-tent map is proposed. The traditional tent map proposed in this paper has an expanded control parameter range and better chaos. In this algorithm, bit rearrangement is adopted to further improve the improved sine-tent map, which can reconstruct the output value and expand the chaotic characteristics of the map. In this algorithm, the image parameters are connected with the algorithm to generate the key. In the encryption step, a method of replacing the most significant bit and scrambling-diffusion algorithm is designed to encrypt the plaintext image. Finally, the algorithm is simulated with the experiment and evaluated with analysis; then, the experimental results are given. The evaluation results show that the ciphertext of the algorithm has high randomness, strong robustness, and better resistance to differential attacks after comparison. The correlation of the ciphertext image pixels is very low, and the algorithm is highly secure as a conclusion.

scholarly journals A Hyperchaotic Color Image Encryption Algorithm and Security Analysis

2019 ◽  
Vol 2019 ◽  
pp. 1-8 ◽  
Author(s):  
Chenghai Li ◽  
Fangzheng Zhao ◽  
Chen Liu ◽  
Lei Lei ◽  
Jie Zhang
Keyword(s):  
Image Encryption ◽  
Color Image ◽  
Gray Code ◽  
Chaotic Sequence ◽  
Encryption Algorithm ◽  
Hyperchaotic System ◽  
Color Image Encryption ◽  
One Dimensional ◽  
Dimensional Matrix ◽  
Image Encryption Algorithm

The current common color image encryption algorithms applying “scrambling-diffusion” have some problems, such as the small key space, the cumbersome encryption process, and the security vulnerability. Aiming at these problems, this paper proposes a new color image encryption algorithm based on the hyperchaotic system and applying “transforming-scrambling-diffusion” model. Before scrambling, in accordance with the plaintext itself attributes, the number of iterations was calculated, all the pixel values of color image were transformed into gray code iteratively, and then the chaotic sequence was generated from the four-dimensional hyperchaotic system. Pixel matrix after gray code transformation was converted to one-dimensional matrix. The chaotic sequence was sorted and the one-dimensional matrix was changed positions correspondingly to complete the whole domain scrambling. And then, bit-operation was executed for image diffusion. The ciphertext can be obtained by matrix transformation. The key sensitivity, histogram, information entropy, correlation, and other evaluation indexes were calculated and analyzed through the simulation experiment. Compared with other algorithms, it can be proved that the encryption algorithm has the strong antiattack ability.

scholarly journals Chaotic Image Encryption Algorithm Based on Circulant Operation

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Xiaoling Huang ◽  
Guodong Ye ◽  
Kwok-Wo Wong
Keyword(s):  
Time Delay ◽  
Image Encryption ◽  
Lorenz System ◽  
Circulant Matrix ◽  
Chaotic Sequence ◽  
Encryption Algorithm ◽  
Secret Keys ◽  
Chaotic Image Encryption ◽  
Image Pixels ◽  
Image Encryption Algorithm

A novel chaotic image encryption scheme based on the time-delay Lorenz system is presented in this paper with the description of Circulant matrix. Making use of the chaotic sequence generated by the time-delay Lorenz system, the pixel permutation is carried out in diagonal and antidiagonal directions according to the first and second components. Then, a pseudorandom chaotic sequence is generated again from time-delay Lorenz system using all components. Modular operation is further employed for diffusion by blocks, in which the control parameter is generated depending on the plain-image. Numerical experiments show that the proposed scheme possesses the properties of a large key space to resist brute-force attack, sensitive dependence on secret keys, uniform distribution of gray values in the cipher-image, and zero correlation between two adjacent cipher-image pixels. Therefore, it can be adopted as an effective and fast image encryption algorithm.

scholarly journals An Image Encryption Algorithm Based on Hyperchaotic System and Variable-Step Josephus Problem

2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Xuncai Zhang ◽  
Lingfei Wang ◽  
Yanfeng Wang ◽  
Ying Niu ◽  
Yinhua Li
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Encryption Algorithm ◽  
Pseudorandom Sequence ◽  
Hyperchaotic System ◽  
Pseudorandom Sequences ◽  
Depth Analysis ◽  
Variable Step ◽  
Image Pixels ◽  
Image Encryption Algorithm

In this paper, an image encryption algorithm based on a hyperchaotic system and variable-step Josephus problem is proposed. Based on an in-depth analysis of the classic Josephus problem, a new variable-step Josephus problem that combines the pseudorandom sequence with the Josephus problem is proposed. Firstly, the hash value of the plaintext image is calculated, which is converted to the initial value of the chaotic system. Secondly, the chaotic system is iterated to generate four pseudorandom sequences X, Y, Z, and W. The sequences X, Y, and Z are input as parameters into the variable-step Josephus function to scramble the positions of the rows, pixel bits, and columns of the image, respectively. Finally, the elements of the sequence W and the image pixels are used to perform the addition operation. According to the experiments, the information entropy of the encrypted image with size 256 ∗ 256 reaches 7.997 and the adjacent correlations in three directions are within ±0.01. The experimental results show that image encryption algorithm proposed in this paper has plaintext sensitivity and can resist the common attacks.

scholarly journals Image Encryption Algorithm Based On Genetic Crossover And Chaotic DNA Encoding

2021 ◽  
Author(s):  
Younes Qobbi ◽  
Abdeltif jarjar ◽  
Mohamed Essaid ◽  
Abdelhamid Benazzi
Keyword(s):  
Image Encryption ◽  
Dna Sequences ◽  
Chaotic Map ◽  
Logistic Map ◽  
Dna Encoding ◽  
Differential Attack ◽  
Avalanche Effect ◽  
Diffusion Phase ◽  
The Impact ◽  
Image Encryption Algorithm

Abstract Based on the two-dimensional logistic map and a single improved genetic operator, a new image encryption system is proposed. The original image is transformed into DNA sequences, a subdivision into blocks of size calculated by using the chaotic map, with the intention to apply a crossover between blocks chaotically selected from a chaotic control vectors. For the installation of a diffusion phase, a strong link is established between the block resulting from a crossing operation and the next original block. Hoping to considerably increase the impact of the avalanche effect and protect the system against any differential attack. Simulations performed on a large number of images of different size and formats ensure that our method is not subject to any known attacks.

Image Encryption Algorithm Based on Substitution Principle and Shuffling Scheme

2020 ◽  
Vol 38 (3B) ◽  
pp. 98-103
Author(s):  
Atyaf S. Hamad ◽  
Alaa K. Farhan
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Second Phase ◽  
Cipher Text ◽  
The Face ◽  
Substitution Principle ◽  
2D Logistic Map ◽  
Image Encryption Algorithm

This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first phase because of including an S-box based on using substitution by AES algorithm in encryption and its inverse in Decryption. In the second phase, shifting and rotation were used based on secrete key in each channel depending on the result from the chaotic map, 2D logistic map and the output was processed and used for the encryption algorithm. It is known from earlier studies that simple encryption of images based on the scheme of shuffling is insecure in the face of chosen cipher text attacks. Later, an extended algorithm has been projected. This algorithm performs well against chosen cipher text attacks. In addition, the proposed approach was analyzed for NPCR, UACI (Unified Average Changing Intensity), and Entropy analysis for determining its strength.

Sign in / Sign up

Export Citation Format

Share Document