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 On the Sanctuary of a Combined Confusion and Diffusion based scheme for Image Encryption

2019 ◽  
Vol 9 (1) ◽  
pp. 3258-3263 ◽  
Keyword(s):  
Image Encryption ◽  
Initial Conditions ◽  
Random Sequence ◽  
Multimedia Data ◽  
Hadamard Transformation ◽  
Key Length ◽  
Two Stages ◽  
Sequence Generator ◽  
And Diffusion ◽  
Confusion And Diffusion

Confusion and diffusion are the frequently used embryonics in multimedia (image) encryption systems. Multimedia data protection against cryptanalysis can be effectually fortified by these techniques. Due to inherent properties of images such as high inter-pixel redundancy and bulk data capacity, encryption is performed in two stages: Confusion and Diffusion. In this article, a combined Pseudo Hadamard transformation in the confusion stage and Gingerbreadman chaotic substitution in the diffusion stage are used in the encryption phase of the algorithm. The strong correlation between contiguous elements in the host image is effectually reduced using Pseudo Hadamard transformation and entropy in the cipher image is enhanced using Gingerbreadman chaotic substitution. Secrete key length used in the algorithm is 128 bits, these are the initial conditions for Gingerbreadman chaotic generator. The elements of S-box in the substitution stage are considered from this random sequence generator. Experimental exploration including information entropy, correlation analysis, sensitivity analysis, key space analysis and computational complexity have been performed on set of standard images. Results obtained are better compared to many existing systems.

scholarly journals Chaotic Image Cryptography Systems: A Review

2021 ◽  
Vol 3 (2) ◽  
pp. 129-143
Author(s):  
Amal Hameed Khaleel ◽  
Iman Q. Abduljaleel
Keyword(s):  
Image Encryption ◽  
Digital Images ◽  
Initial Conditions ◽  
Chaotic Map ◽  
Scientific Review ◽  
One Dimensional ◽  
Efficiency Of Algorithms ◽  
Important Field ◽  
Extreme Sensitivity ◽  
Sensitivity To Initial Conditions

In recent decades, image encryption has been a popular and important field of research. The image encryption techniques have been studied thoroughly to ensure the safety of digital images on transmission through the networks. A large range of algorithms for chaotic-based cryptographic systems has been suggested and submitted to enhance the efficiency of the encryption methods. The chaotic map is one technique to guarantee security. The benefits of chaotic image encryption include the fact that it is simple to implement; it has a faster encryption speed, and it is powerful against attacks. Due to their extreme sensitivity to initial conditions, unpredictability, and random-like behaviours, many image encryption systems using chaotic maps have been proposed. This study paper presents a scientific review of many types of researches during the (2014-2020) years that used chaotic with its various types (one-dimensional, multi-dimensional, or hyper-chaotic) to process the digital images in the encryption stage or the scrambling phase. Furthermore, it presents a future reading of researches that has a wider role in developing the cryptography field by improving the efficiency of Algorithms where using a chaotic map with other methods gives better results than using chaotic alone in scrambling and encryption methods.

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.

scholarly journals Analysis of Neural Network Based Ciphers

2021 ◽  
Author(s):  
Maryam Arvandi
Keyword(s):  
Neural Networks ◽  
Block Cipher ◽  
Statistical Tests ◽  
Back Propagation ◽  
Variable Step Size ◽  
Step Size ◽  
Variable Step ◽  
And Diffusion ◽  
Confusion And Diffusion ◽  
Diffusion Properties

Cryptography can be considered one of the most important aspects of communication security with existence of many threats and attacks to the systems. Unbreakableness is the main feature of a cryptographic cipher. In this thesis, feasibility of using neural networks, due to their computational capabilities is investigated for designing new cryptography methods. A newly proposed block cipher based on recurrent neural networks has also been analysed It is shown that: the new scheme is not a block cipher, and it should be referred to as a symmetric cipher; the simple architecture of the network is compatible with the requirement for confusion, and diffusion properties of a cryptosystem; the back propagation with variable step size without momentum, has the best result among other back propagation algorithms; the output of the network, the ciphertext, is not random, proved by using three statistical tests; the cipher is resistant to some fundamental cryptanalysis attacks, and finally a possible chosen-plaintext attack is presented.

scholarly journals Dynamic Analysis and Cryptographic Application of a Sinusoidal-polynomial Composite Chaotic System

2021 ◽  
Author(s):  
Hegui Zhu ◽  
Jiangxia Ge ◽  
Wentao Qi ◽  
Xiangde Zhang ◽  
Xiaoxiong Lu
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Chaotic Behavior ◽  
Initial Conditions ◽  
Encryption Algorithm ◽  
Topological Transitivity ◽  
Detailed Simulation ◽  
Definition Of ◽  
Image Encryption Algorithm ◽  
Sensitivity To Initial Conditions

Abstract Owning to complex properties of ergodicity, non-periodic ability and sensitivity to initial states, chaotic systems are widely used in cryptography. In this paper, we propose a sinusoidal--polynomial composite chaotic system (SPCCS), and prove that it satisfies Devaney's definition of chaos: the sensitivity to initial conditions, topological transitivity and density of periodic points. The experimental results show that the SPCCS has better unpredictability and more complex chaotic behavior than the classical chaotic maps. Furthermore, we provide a new image encryption algorithm combining pixel segmentation operation, block chaotic matrix confusing operation, and pixel diffusion operation with the SPCCS. Detailed simulation results verify effectiveness of the proposed image encryption algorithm.

Image Encryption Based on Development of Hénon Chaotic Maps using Fractional Fourier Transform

2014 ◽  
Vol 5 (3) ◽  
pp. 62-77 ◽  
Author(s):  
Mona F. M. Mursi ◽  
Hossam Eldin H. Ahmed ◽  
Fathi E. Abd El-Samie ◽  
Ayman H. Abd El-Aziem
Keyword(s):  
Fourier Transform ◽  
Image Encryption ◽  
Chaotic Maps ◽  
Fractional Fourier Transform ◽  
Chaotic Map ◽  
Security Analysis ◽  
Experimental Tests ◽  
It Use ◽  
Arnold Cat Map ◽  
And Diffusion

In this paper, the authors propose an image encryption scheme based on the development of a Hénon chaotic map using fractional Fourier transform (FRFT) which is introduced to satisfy the necessity of high secure image. This proposed algorithm combines the main advantages of confusion and diffusion with (FRFT), it use Arnold Cat map for confusion and Hénon chaotic map or one of the proposed Hénon chaotic maps for diffusion. The proposed algorithm is compared with some image encryption algorithms based on Arnold Cat map, Baker chaotic map, Hénon chaotic map and RC6. The authors perform a comparison between them in several experimental tests as statistical analyses, processing time and security analysis. The authors find from these comparison tests that the proposed algorithm demonstrates good result even better than RC6 and other chaotic maps in some cases.

Lightweight Image Encryption: A Chaotic ARX Block Cipher

2020 ◽  
pp. 2150026
Author(s):  
N. Mohananthini ◽  
M. Y. Mohamed Parvees ◽  
J. Abdul Samath
Keyword(s):  
Image Encryption ◽  
Block Cipher ◽  
Chaotic Map ◽  
Encryption Scheme ◽  
Lightweight Cryptography ◽  
Low Resource ◽  
Image Cipher ◽  
Euler Methods ◽  
And Diffusion ◽  
Randomness Tests

Nowadays, lightweight cryptography attracts academicians, scientists and researchers to concentrate on its requisite with the increasing usage of low resource devices. In this paper, a new lightweight image encryption scheme is proposed using the Lorenz 3D super chaotic map. This encryption scheme is an addition–rotation–XOR block cipher designed for its supremacy, efficacy and speed execution. In this addition–rotation–XOR cipher, the equation for Lorenz 3D chaotic map is iteratively solved to generate double valued signals in a speedy manner using the Runge–Kutta and Euler methods. The addition, rotation and diffusion sequences are generated from the double valued signals, and the source pixels of the 8-bit plain test images are manipulated with the addition, rotation and diffusion of the bytes. Finally, the cipher images are constructed from the manipulated pixels and evaluated with various statistical as well as randomness tests. The results from various tests prove that the proposed chaotic addition–rotation–XOR block image cipher is efficient in terms of randomness and speed.

scholarly journals Quantum Image Encryption Scheme Using Arnold Transform and S-box Scrambling

Entropy ◽  
2019 ◽  
Vol 21 (4) ◽  
pp. 343 ◽  
Author(s):  
Hui Liu ◽  
Bo Zhao ◽  
Linquan Huang
Keyword(s):  
Image Encryption ◽  
Quantum Chaos ◽  
Initial Conditions ◽  
Chaotic Map ◽  
Gray Level ◽  
Encryption Scheme ◽  
Arnold Transform ◽  
Quantum Image ◽  
Quantum Image Encryption ◽  
Mutation Operation

The paper proposes a lossless quantum image encryption scheme based on substitution tables (S-box) scrambling, mutation operation and general Arnold transform with keys. First, the key generator builds upon the foundation of SHA-256 hash with plain-image and a random sequence. Its output value is used to yield initial conditions and parameters of the proposed image encryption scheme. Second, the permutation and gray-level encryption architecture is built by discrete Arnold map and quantum chaotic map. Before the permutation of Arnold transform, the pixel value is modified by quantum chaos sequence. In order to get high scrambling and randomness, S-box and mutation operation are exploited in gray-level encryption stage. The combination of linear transformation and nonlinear transformation ensures the complexity of the proposed scheme and avoids harmful periodicity. The simulation shows the cipher-image has a fairly uniform histogram, low correlation coefficients closed to 0, high information entropy closed to 8. The proposed cryptosystem provides 2256 key space and performs fast computational efficiency (speed = 11.920875 Mbit/s). Theoretical analyses and experimental results prove that the proposed scheme has strong resistance to various existing attacks and high level of security.

scholarly journals Sources of uncertainty in deterministic dynamics: an informal overview

2011 ◽  
Vol 369 (1956) ◽  
pp. 4705-4729 ◽  
Author(s):  
Ian Stewart
Keyword(s):  
Chaotic Dynamics ◽  
Chaotic Systems ◽  
Initial Conditions ◽  
Sources Of Uncertainty ◽  
Deterministic Systems ◽  
Coin Tossing ◽  
Random Switching ◽  
Butterfly Effect ◽  
Basin Boundaries ◽  
Sensitivity To Initial Conditions

The discovery of chaotic dynamics implies that deterministic systems may not be predictable in any meaningful sense. The best-known source of unpredictability is sensitivity to initial conditions (popularly known as the butterfly effect), in which small errors or disturbances grow exponentially. However, there are many other sources of uncertainty in nonlinear dynamics. We provide an informal overview of some of these, with an emphasis on the underlying geometry in phase space. The main topics are the butterfly effect, uncertainty in initial conditions in non-chaotic systems, such as coin tossing, heteroclinic connections leading to apparently random switching between states, topological complexity of basin boundaries, bifurcations (popularly known as tipping points) and collisions of chaotic attractors. We briefly discuss possible ways to detect, exploit or mitigate these effects. The paper is intended for non-specialists.

Sign in / Sign up

Export Citation Format

Share Document