scholarly journals A Simple Chaotic Map-Based Image Encryption System Using Both Plaintext Related Permutation and Diffusion

Entropy ◽  
2018 ◽  
Vol 20 (7) ◽  
pp. 535 ◽  
Author(s):  
Linqing Huang ◽  
Shuting Cai ◽  
Mingqing Xiao ◽  
Xiaoming Xiong
Keyword(s):  
Image Encryption ◽  
High Efficiency ◽  
Color Image ◽  
Chaotic Map ◽  
Original Image ◽  
Diffusion Structure ◽  
High Security ◽  
Encryption Schemes ◽  
Differential Attacks ◽  
And Diffusion

Recently, to conquer most non-plain related chaos-based image cryptosystems’ security flaws that cannot resist the powerful chosen/knownn plain-text attacks or differential attacks efficiently for less plaintext sensitivity, many plain related chaos-based image cryptosystems have been developed. Most cryptosystems that have adopted the traditional permutation–diffusion structure still have some drawbacks and security flaws: (1) most plaintext related image encryption schemes using only plaintext related confusion operation or only plaintext related diffusion operation relate to plaintext inadequately that cannot achieve high plaintext sensitivity; (2) in some algorithms, the generation of security key that needs to be sent to the receiver is determined by the original image, so these algorithms may not applicable to real-time image encryption; (3) most plaintext related image encryption schemes have less efficiency because more than one round permutation–diffusion operation is required to achieve high security. To obtain high security and efficiency, a simple chaotic based color image encryption system by using both plaintext related permutation and diffusion is presented in this paper. In our cryptosystem, the values of the parameters of cat map used in permutation stage are related to plain image and the parameters of cat map are also influenced by the diffusion operation. Thus, both the permutation stage and diffusion stage are related to plain images, which can obtain high key sensitivity and plaintext sensitivity to resist chosen/known plaintext attacks or differential attacks efficiently. Furthermore, only one round of plaintext related permutation and diffusion operation is performed to process the original image to obtain cipher image. Thus, the proposed scheme has high efficiency. Complete simulations are given and the simulation results prove the excellent security and efficiency of the proposed scheme.

scholarly journals Image encryption under spatial domain based on modify 2D LSCM chaotic map via dynamic substitution-permutation network

2021 ◽  
Vol 11 (4) ◽  
pp. 3070
Author(s):  
Rana Saad Mohammed ◽  
Khalid Kadhim Jabbar ◽  
Hussien Abid Hilal
Keyword(s):  
Image Encryption ◽  
Diffusion Processes ◽  
Color Image ◽  
Chaotic Map ◽  
Spatial Domain ◽  
Key Space ◽  
Main Color ◽  
Differential Attacks ◽  
And Diffusion

Image encryption has become an important application aspect of information security. Most attempts are focused on increasing the security aspect, the quality of the resulting image, and the time consumed. On the other hand, dealing with the color image under the spatial domain in this filed is considered as another challenge added to the proposed method that make it sensitivity and difficulty. The proposed method aims to encode a color image by dealing with the main color components of the red (R), green (G), and blue (B) components of a color image to strengthen the dependence of each component by modifying a two dimensional logistic- sine coupling map (2D- LSCM). This is to satisfy the statistical features and reduce time-consumption, and benefit from a mixing step of the second of advanced encryption standard (AES) candidates (serpent block cipher) and modified it to achieve in addition of confusion and diffusion processes. The experimental results showed that our proposed method had the ability to resist against statistical attacks and differential attacks. It also had a uniform histogram, a large key space, complex and faster, closer Shannon entropy to 8, and low correlation values between two adjacent pixels compared with other methods.

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 A Novel Image Encryption Scheme Based on PWLCM and Standard Map

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-23
Author(s):  
Yucheng Chen ◽  
Chunming Tang ◽  
Zongxiang Yi
Keyword(s):  
Image Encryption ◽  
Initial Conditions ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Encryption Scheme ◽  
Standard Map ◽  
Diffusion Structure ◽  
Piecewise Linear Chaotic Map ◽  
Encryption Schemes ◽  
And Performance

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.

A plain-text independent color image encryption system with multi-thread permutation and multi-channel diffusion

2021 ◽  
Author(s):  
Hao Zhang ◽  
Zhenyu Li ◽  
Pengfei Yan ◽  
Xiaoqing Wang ◽  
Xingyuan Wang
Keyword(s):  
Computational Complexity ◽  
Image Encryption ◽  
Color Image ◽  
Coupled Map Lattice ◽  
Experimental Results ◽  
Color Image Encryption ◽  
Plain Text ◽  
Differential Attacks ◽  
And Diffusion ◽  
Subsequent Diffusion

In this paper, we present a novel multi-threaded parallel permutation and channel-combined diffusion for image encryption which is independent of plain text. In our proposed method, the coupled map lattice is used to generate the key sequences for multi-thread permutation and diffusion. Then intra- and inter-thread permutations are achieved using multi-threading in combination with the tent mapping. For the subsequent diffusion, this paper introduces a method based on channel-combined diffusing which simultaneously diffuses three channels. Experimental results indicate a high encryption performance with the capability of effectively resisting the known plain text and differential attacks. Our proposed method also has a lower computational complexity which enables its applicability in practical scenarios.

scholarly journals Cryptanalysis and Improvement of a Chaotic Map-Based Image Encryption System Using Both Plaintext Related Permutation and Diffusion

Entropy ◽  
2020 ◽  
Vol 22 (5) ◽  
pp. 589
Author(s):  
Cheng-Yi Lin ◽  
Ja-Ling Wu
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Chosen Plaintext Attack ◽  
Differential Attacks ◽  
And Diffusion

In theory, high key and high plaintext sensitivities are a must for a cryptosystem to resist the chosen/known plaintext and the differential attacks. High plaintext sensitivity can be achieved by ensuring that each encrypted result is plaintext-dependent. In this work, we make detailed cryptanalysis on a published chaotic map-based image encryption system, where the encryption process is plaintext Image dependent. We show that some designing flaws make the published cryptosystem vulnerable to chosen-plaintext attack, and we then proposed an enhanced algorithm to overcome those flaws.

A New Image Encryption Scheme Using Dual Chaotic Map Synchronization

2020 ◽  
Vol 18 (1) ◽  
Keyword(s):  
Image Encryption ◽  
Chaotic Systems ◽  
Initial Conditions ◽  
Chaotic Map ◽  
Security Applications ◽  
The Common ◽  
And Diffusion ◽  
Confusion And Diffusion ◽  
Sensitivity To Initial Conditions ◽  
Diffusion Properties

Chaotic systems behavior attracts many researchers in the field of image encryption. The major advantage of using chaos as the basis for developing a crypto-system is due to its sensitivity to initial conditions and parameter tunning as well as the random-like behavior which resembles the main ingredients of a good cipher namely the confusion and diffusion properties. In this article, we present a new scheme based on the synchronization of dual chaotic systems namely Lorenz and Chen chaotic systems and prove that those chaotic maps can be completely synchronized with other under suitable conditions and specific parameters that make a new addition to the chaotic based encryption systems. This addition provides a master-slave configuration that is utilized to construct the proposed dual synchronized chaos-based cipher scheme. The common security analyses are performed to validate the effectiveness of the proposed scheme. Based on all experiments and analyses, we can conclude that this scheme is secure, efficient, robust, reliable, and can be directly applied successfully for many practical security applications in insecure network channels such as the Internet

scholarly journals Non-Linear Hopped Chaos Parameters-Based Image Encryption Algorithm Using Histogram Equalization

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 535
Author(s):  
Karim H. Moussa ◽  
Ahmed I. El Naggary ◽  
Heba G. Mohamed
Keyword(s):  
Image Encryption ◽  
Initial Conditions ◽  
Signal To Noise Ratio ◽  
Chaotic Map ◽  
Histogram Equalization ◽  
Encryption Algorithm ◽  
Multimedia Contents ◽  
Encryption Schemes ◽  
Change Intensity ◽  
Increasing Demand

Multimedia wireless communications have rapidly developed over the years. Accordingly, an increasing demand for more secured media transmission is required to protect multimedia contents. Image encryption schemes have been proposed over the years, but the most secure and reliable schemes are those based on chaotic maps, due to the intrinsic features in such kinds of multimedia contents regarding the pixels’ high correlation and data handling capabilities. The novel proposed encryption algorithm introduced in this article is based on a 3D hopping chaotic map instead of fixed chaotic logistic maps. The non-linearity behavior of the proposed algorithm, in terms of both position permutation and value transformation, results in a more secured encryption algorithm due to its non-convergence, non-periodicity, and sensitivity to the applied initial conditions. Several statistical and analytical tests such as entropy, correlation, key sensitivity, key space, peak signal-to-noise ratio, noise attacks, number of pixels changing rate (NPCR), unified average change intensity randomness (UACI), and others tests were applied to measure the strength of the proposed encryption scheme. The obtained results prove that the proposed scheme is very robust against different cryptography attacks compared to similar encryption schemes.

Sign in / Sign up

Export Citation Format

Share Document