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 ENHANCED CHAOTIC IMAGE ENCRYPTION ALGORITHM BASED ON TRIGONOMETRIC FUNCTIONS

2013 ◽  
pp. 246-249
Author(s):  
M.K MOHSINA ◽  
ROBIN ABRAHAM
Keyword(s):  
Image Encryption ◽  
Chaotic Maps ◽  
Initial Conditions ◽  
Random Sequence ◽  
Chaotic Map ◽  
Secret Key ◽  
Home Office ◽  
One Dimensional ◽  
Extreme Sensitivity ◽  
Differential Attacks

The advent of wireless communications, both inside and outside the home-office environment has led to an Increased demand for effective encryption systems. The encryption of images is quite different from that of the texts due to the bulk data capacity and high redundancy of images. Traditional methods are difficult to handle the image encryption because of their small space of pseudo random sequence. At present, the chaotic maps have been widely used in image encryption for their extreme sensitivity to tiny changes of initial conditions. The chaos based algorithms have suggested a new and efficient way to deal with the problem of fast and highly secure image encryption. In this paper, we propose an algorithm in which two one-dimensional chaotic maps are used instead of a one-dimensional chaotic map. We also use an external secret key of 96-bits. Thereby it significantly increases the resistance to statistical and differential attacks. The results of experiment, statistical analysis, correlation coefficient analysis and key sensitivity tests show that the algorithm is of great security and practicability.

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.

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.

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.

SYNCHRONIZATION STABILITY ANALYSIS OF THE CHAOTIC RÖSSLER SYSTEM

1996 ◽  
Vol 06 (11) ◽  
pp. 2153-2161 ◽  
Author(s):  
QINGXIAN XIE ◽  
GUANRONG CHEN
Keyword(s):  
Initial Conditions ◽  
Sufficient Conditions ◽  
General Situation ◽  
Wide Range ◽  
Rossler System ◽  
Extreme Sensitivity ◽  
System Synchronization ◽  
Rössler System ◽  
Type Of Stability ◽  
Sensitivity To Initial Conditions

In this paper we show, both analytically and experimentally, that the Rössler system synchronization is either asymptotically stable or orbitally stable within a wide range of the system key parameters. In the meantime, we provide some simple sufficient conditions for synchronization stabilities of the Rössler system in a general situation. Our computer simulation shows that the type of stability of the synchronization is very sensitive to the initial values of the two (drive and response) Rössler systems, especially for higher-periodic synchronizing trajectories, which is believed to be a fundamental characteristic of chaotic synchronization that preserves the extreme sensitivity to initial conditions of chaotic systems.

Sign in / Sign up

Export Citation Format

Share Document