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 A New One-Dimensional Compound Chaotic System and Its Application in High-Speed Image Encryption

2021 ◽  
Vol 11 (23) ◽  
pp. 11206
Author(s):  
Shenli Zhu ◽  
Xiaoheng Deng ◽  
Wendong Zhang ◽  
Congxu Zhu
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Network Communication ◽  
One Dimensional ◽  
Image Encryption Algorithm

In the edge computing and network communication environment, important image data need to be transmitted and stored securely. Under the condition of limited computing resources, it is particularly necessary to design effective and fast image encryption algorithms. One-dimensional (1D) chaotic maps provide an effective solution for real-time image encryption, but most 1D chaotic maps have only one parameter and a narrow chaotic interval, which has the disadvantage of security. In this paper, a new compound 1D chaotic map composed of a logistic map and tent map is proposed. The new system has two system parameters and an arbitrarily large chaotic parameter interval, and its chaotic signal is evenly distributed in the whole value space so it can improve the security in the application of information encryption. Furthermore, based on the new chaotic system, a fast image encryption algorithm is proposed. The algorithm takes the image row (column) as the cyclic encryption unit, and the time overhead is greatly reduced compared with the algorithm taking the pixel as the encryption unit. In addition, the mechanism of intermediate key associated with image content is introduced to improve the ability of the algorithm to resist chosen-plaintext attack and differential attack. Experiments show that the proposed image encryption algorithm has obvious speed advantages and good cryptographic performance, showing its excellent application potential in secure network communication.

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.

scholarly journals A Lightweight Image Encryption Algorithm Based on Message Passing and Chaotic Map

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Hui Liu ◽  
Bo Zhao ◽  
Jianwen Zou ◽  
Linquan Huang ◽  
Yifan Liu
Keyword(s):  
Image Encryption ◽  
Message Passing ◽  
High Speed ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Pseudorandom Sequence ◽  
Pseudorandom Sequences ◽  
Plain Image ◽  
Image Encryption Algorithm

The popularization of 5G and the development of cloud computing further promote the application of images. The storage of images in an untrusted environment has a great risk of privacy leakage. This paper outlines a design for a lightweight image encryption algorithm based on a message-passing algorithm with a chaotic external message. The message-passing (MP) algorithm allows simple messages to be passed locally for the solution to a global problem, which causes the interaction among adjacent pixels without additional space cost. This chaotic system can generate high pseudorandom sequences with high speed performance. A two-dimensional logistic map is utilized as a pseudorandom sequence generator to yield the external message sets of edge pixels. The external message can affect edge pixels, and then adjacent pixels interact with each other to produce an encrypted image. A MATLAB simulation shows the cipher-image performs fairly uniform distribution and has acceptable information entropy of 7.996749. The proposed algorithm reduces correlation coefficients from plain-image 1 to its cipher-image 0, which covers all of the plain-image characters with high computational efficiency (speed = 18.200374 Mbit/s). Theoretical analyses and experimental results prove the proposed algorithm’s persistence to various existing attacks with low cost.

scholarly journals A Symmetric Image Encryption Algorithm Based on a Coupled Logistic–Bernoulli Map and Cellular Automata Diffusion Strategy

Entropy ◽  
2019 ◽  
Vol 21 (5) ◽  
pp. 504 ◽  
Author(s):  
Wei Zhang ◽  
Zhiliang Zhu ◽  
Hai Yu
Keyword(s):  
Cellular Automata ◽  
Image Encryption ◽  
High Efficiency ◽  
Chaotic Map ◽  
Logistic Map ◽  
Three Dimensional ◽  
Encryption Algorithm ◽  
Original Structure ◽  
One Dimensional ◽  
Image Encryption Algorithm

In this paper, the properties of the classical confusion–substitution structure and some recently proposed pseudorandom number generators using one-dimensional chaotic maps are investigated. To solve the low security problem of the original structure, a new bit-level cellular automata strategy is used to improve the sensitivity to the cryptosystem. We find that the new evolution effects among different generations of cells in cellular automata can significantly improve the diffusion effect. After this, a new one-dimensional chaotic map is proposed, which is constructed by coupling the logistic map and the Bernoulli map (LBM). The new map exhibits a much better random behavior and is more efficient than comparable ones. Due to the favorable properties of the new map and cellular automata algorithm, we propose a new image-encryption algorithm in which three-dimensional bit-level permutation with LBM is employed in the confusion phase. Simulations are carried out, and the results demonstrate the superior security and high efficiency of the proposed scheme.

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 A Novel Color Image Encryption Algorithm Based on Hyperchaotic Maps and Mitochondrial DNA Sequences

Entropy ◽  
2020 ◽  
Vol 22 (2) ◽  
pp. 158
Author(s):  
Heba G. Mohamed ◽  
Dalia H. ElKamchouchi ◽  
Karim H. Moussa
Keyword(s):  
Image Encryption ◽  
Dna Sequences ◽  
Color Image ◽  
Chaotic Map ◽  
Color Image Encryption ◽  
Plain Text ◽  
Differential Attacks ◽  
Image Encryption Algorithm ◽  
Multimedia Encryption ◽  
Human Mitochondrial Genome

Multimedia encryption innovation is one of the primary ways of securely and privately guaranteeing the security of media transmission. There are many advantages when utilizing the attributes of chaos, for example, arbitrariness, consistency, ergodicity, and initial condition affectability, for any covert multimedia transmission. Additionally, many more benefits can be introduced with the exceptional space compliance, unique information, and processing capability of real mitochondrial deoxyribonucleic acid (mtDNA). In this article, color image encryption employs a confusion process based on a hybrid chaotic map, first to split each channel of color images into n-clusters; then to create global shuffling over the whole image; and finally, to apply intrapixel shuffling in each cluster, which results in very disordered pixels in the encrypted image. Then, it utilizes the rationale of human mitochondrial genome mtDNA to diffuse the previously confused pixel values. Hypothetical examination and trial results demonstrate that the anticipated scheme exhibits outstanding encryption, as well as successfully opposes chosen/known plain text, statistical, and differential attacks.

scholarly journals Image Encryption Algorithm Based on DNA Encoding and Chaotic Maps

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Jian Zhang ◽  
DongXin Fang ◽  
Honge Ren
Keyword(s):  
Image Encryption ◽  
Dna Sequences ◽  
Random Number ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Dna Encoding ◽  
Before And After ◽  
Image Encryption Algorithm

We propose a new image encryption algorithm based on DNA sequences combined with chaotic maps. This algorithm has two innovations: (1) it diffuses the pixels by transforming the nucleotides into corresponding base pairs a random number of times and (2) it confuses the pixels by a chaotic index based on a chaotic map. For any size of the original grayscale image, the rows and columns are fist exchanged by the arrays generated by a logistic chaotic map. Secondly, each pixel that has been confused is encoded into four nucleotides according to the DNA coding. Thirdly, each nucleotide is transformed into the corresponding base pair a random number of time(s) by a series of iterative computations based on Chebyshev’s chaotic map. Experimental results indicate that the key account of this algorithm is 1.536 × 10127, the correlation coefficient of a 256 × 256 Lena image between, before, and after the encryption processes was 0.0028, and the information entropy of the encrypted image was 7.9854. These simulation results and security analysis show that the proposed algorithm not only has good encryption effect, but also has the ability to repel exhaustive, statistical, differential, and noise attacks.

Image Encryption Algorithm Based on 3D Arnold Cat and Logistic Map

2011 ◽  
Vol 317-319 ◽  
pp. 1537-1540 ◽  
Author(s):  
Tian Gong Pan ◽  
Da Yong Li
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Simulation Experiments ◽  
Arnold Cat Map ◽  
Classical Transformation ◽  
Image Encryption Algorithm ◽  
Small Period

Arnold cat map is a classical transformation of image encryption, but it has some shortcomings such as short key quantities, small period and so on. On the basis of Arnold cat map, it presented an algorithm of image encryption based on 3D Arnold cat and chaotic map. Simulation experiments show that the encryption algorithm has characters of strong keys, better effect and fast.

scholarly journals An Image Encryption Algorithm Using Logistic Map with Plaintext-Related Parameter Values

Entropy ◽  
2021 ◽  
Vol 23 (11) ◽  
pp. 1373
Author(s):  
Jakub Oravec ◽  
Lubos Ovsenik ◽  
Jan Papaj
Keyword(s):  
Image Encryption ◽  
Chaotic Behavior ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Parameter Modification ◽  
Modification Technique ◽  
Plain Image ◽  
Parameter Values ◽  
Image Encryption Algorithm

This paper deals with a plaintext-related image encryption algorithm that modifies the parameter values used by the logistic map according to plain image pixel intensities. The parameter values are altered in a row-wise manner, which enables the usage of the same procedure also during the decryption. Furthermore, the parameter modification technique takes into account knowledge about the logistic map, its fixed points and possible periodic cycles. Since the resulting interval of parameter values achieves high positive values of Lyapunov exponents, the chaotic behavior of the logistic map should be most pronounced. These assumptions are verified by a set of experiments and the obtained numerical values are compared with those reported in relevant papers. It is found that the proposed design that uses a simpler, but well-studied, chaotic map with mitigated issues obtains results comparable with algorithms that use more complex chaotic systems. Moreover, the proposed solution is much faster than other approaches with a similar purpose.

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.

Sign in / Sign up

Export Citation Format

Share Document