scholarly journals Double image multi-encryption algorithm based on fractional chaotic time series

2015 ◽  
Vol 13 (1) ◽  
Author(s):  
Zhenghong Guo ◽  
Jie Yang ◽  
Yang Zhao
Keyword(s):  
Time Series ◽  
Chaotic Time Series ◽  
Encryption Algorithm ◽  
Brute Force ◽  
Double Image ◽  
Key Space ◽  
Plain Image ◽  
Image Pixels ◽  
Brute Force Attack ◽  
The Relationship

AbstractIn this paper, we introduce a new image encryption scheme based on fractional chaotic time series, in which shuffling the positions blocks of plain-image and changing the grey values of image pixels are combined to confuse the relationship between the plain-image and the cipher-image. Also, the experimental results demonstrate that the key space is large enough to resist the brute-force attack and the distribution of grey values of the encrypted image has a random-like behavior.

Double Image Multi-Encryption Algorithm Based on Fractional Chaotic Time Series

2015 ◽  
Vol 12 (11) ◽  
pp. 4980-4986 ◽  
Author(s):  
Liguo Zhang ◽  
Binghang He ◽  
Jianguo Sun ◽  
Mingzhu Lai ◽  
Zhihan Lv
Keyword(s):  
Time Series ◽  
Chaotic Time Series ◽  
Encryption Algorithm ◽  
Double Image

scholarly journals A Fast Enhanced Secure Image Chaotic Cryptosystem Based on Hybrid Chaotic Magic Transform

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Srinivas Koppu ◽  
V. Madhu Viswanatham
Keyword(s):  
Brute Force ◽  
Lanczos Algorithm ◽  
Root Characteristics ◽  
Pseudorandom Generator ◽  
Key Space ◽  
Encryption And Decryption ◽  
Key Sensitivity ◽  
Image Pixels ◽  
Brute Force Attack ◽  
Differential Attacks

An enhanced secure image chaotic cryptosystem has been proposed based on hybrid CMT-Lanczos algorithm. We have achieved fast encryption and decryption along with privacy of images. The pseudorandom generator has been used along with Lanczos algorithm to generate root characteristics and eigenvectors. Using hybrid CMT image, pixels are shuffled to accomplish excellent randomness. Compared with existing methods, the proposed method had more robustness to various attacks: brute-force attack, known cipher plaintext, chosen-plaintext, security key space, key sensitivity, correlation analysis and information entropy, and differential attacks. Simulation results show that the proposed methods give better result in protecting images with low-time complexity.

scholarly journals An Image Encryption Scheme Using 2D Generalized Sawtooth Maps

2014 ◽  
Vol 12 (6) ◽  
pp. 3570-3579
Author(s):  
Ruisong Ye ◽  
Wenping Yu
Keyword(s):  
Statistical Analysis ◽  
Detailed Analysis ◽  
Image Encryption ◽  
Experimental Results ◽  
Encryption Scheme ◽  
Brute Force ◽  
Key Space ◽  
Image Pixels ◽  
Brute Force Attack ◽  
Gray Values

In this paper, a new image encryption scheme based on 2D generalized sawtooth map is proposed. Utilizing the chaoticnature of 2D generalized sawtooth maps, image pixel positions are scrambled and image pixels gray values are changedto encrypt the plain-images. Experimental results have been carried out with detailed analysis to demonstrate that theproposed image encryption scheme possesses large key space to resist brute-force attack and possesses good statisticalproperties to frustrate statistical analysis attacks.

scholarly journals 3-Image Bit-Level Encryption Algorithm Based on 3D Nonequilateral Arnold Transformation and Hyperchaotic System

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Huiqing Huang ◽  
Dongsheng Cheng
Keyword(s):  
Color Image ◽  
Encryption Algorithm ◽  
Hyperchaotic System ◽  
Brute Force ◽  
Differential Analysis ◽  
Key Space ◽  
Bit Planes ◽  
Brute Force Attack ◽  
Differential Attacks ◽  
Arnold Transformation

In this paper, we propose a novel 3-image bit-level encryption algorithm based on 3D nonequilateral Arnold transformation and hyperchaotic system. Firstly, the three plain images with N × M are decomposed into 8-bit planes and then they overlap into a 3D bit matrix with size N × M × 24 . Then, the 3D bit matrix is scrambled by 3D nonequilateral Arnold transformation and the scrambled 3D bit matrix is integrated and transformed into three 2D pixel-level images. Finally, the hyperchaotic system is used to diffuse the three 2D pixel-level images; then three diffused images are rearranged to be one color image, resulting in the encrypted image. Numerical simulations and analyses of the proposed encryption scheme are given to validate the feasibility and safety of the method. The statistical analyses like histogram, correlation, and entropy confirm that the proposed method can effectively resist statistical attacks and security key analysis shows that the key space is large enough to render the brute-force attack ineffective in proposed method. The differential analysis confirms that the proposed method is effective against differential attacks and the results of the experiment confirmed that the method can resist occlusion attack.

scholarly journals An Efficient Method of Image Encryption Using Rossler Chaotic System

2021 ◽  
Vol 10 (2) ◽  
pp. 11
Author(s):  
Yasir Ahmed Hamza ◽  
Marwan Dahar Omer
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Initial Conditions ◽  
Computation Time ◽  
Encryption Algorithm ◽  
Brute Force ◽  
Symmetric Encryption ◽  
New Approach ◽  
System Parameters ◽  
Plain Image

In this study, a new approach of image encryption has been proposed. This method is depends on the symmetric encryption algorithm RC4 and Rossler chaotic system. Firstly, the encryption key is employed to ciphering a plain image using RC4 and obtains a ciphered-image. Then, the same key is used to generate the initial conditions of the Rossler system. The system parameters and the initial conditions are used as the inputs for Rossler chaotic system to generate the 2-dimensional array of random values. The resulted array is XORed with the ciphered-image to obtain the final encrypted-image. Based on the experimental results, the proposed method has achieved high security and less computation time. Also, the proposed method can be resisted attacks like (statistical, brute-force, and differential).

A Novel Algorithm for Block Encryption of Digital Image Based on Chaos

2011 ◽  
Vol 5 (1) ◽  
pp. 59-74 ◽  
Author(s):  
Jun Peng ◽  
Du Zhang ◽  
Xiaofeng Liao
Keyword(s):  
Three Dimensional ◽  
Encryption Algorithm ◽  
Brute Force ◽  
Secret Key ◽  
Image Block ◽  
Differential Attack ◽  
Avalanche Effect ◽  
Chaotic Dynamical System ◽  
Key Space ◽  
Block Encryption

This paper proposes a novel image block encryption algorithm based on three-dimensional Chen chaotic dynamical system. The algorithm works on 32-bit image blocks with a 192-bit secret key. The idea is that the key is employed to drive the Chen’s system to generate a chaotic sequence that is inputted to a specially designed function G, in which we use new 8x8 S-boxes generated by chaotic maps (Tang, 2005). In order to improve the robustness against differental cryptanalysis and produce desirable avalanche effect, the function G is iteratively performed several times and its last outputs serve as the keystreams to encrypt the original image block. The design of the encryption algorithm is described along with security analyses. The results from key space analysis, differential attack analysis, and information entropy analysis, correlation analysis of two adjacent pixels prove that the proposed algorithm can resist cryptanalytic, statistical and brute force attacks, and achieve a higher level of security. The algorithm can be employed to realize the security cryptosystems over the Internet.

Image Encryption Algorithm Based on Chaos and S-Boxes Scrambling

2010 ◽  
Vol 171-172 ◽  
pp. 299-304 ◽  
Author(s):  
Zhuo Hui Xian ◽  
Shi Liang Sun
Keyword(s):  
Image Encryption ◽  
Chaotic Maps ◽  
Encryption Algorithm ◽  
Brute Force ◽  
Simulation Experiments ◽  
Encryption Algorithms ◽  
Brute Force Attack ◽  
Image Encryption Algorithm

Due to some features of images, traditional encryption algorithms are not suitable for practical image encryption. Considering this problem, a novel feistel network image encryption algorithm is proposed in this paper. Taking advantage of the desirable properties of mixing and sensitivity to initial parameters of chaotic maps, a sub key generator with couple chaotic maps is presented in this scheme. Meanwhile, the encryption algorithm includes a new mixing algorithm which is designed with thirty s-boxes of AES. To enhance the security of the new scheme, the encryption processes were combined in feistel network. The results of analysis and simulation experiments indicate that the scheme is secure and performed well in preventing attacks, such as brute force attack, entropy attack and statistics attack.

scholarly journals Image Blocking Encryption Algorithm Based on Laser Chaos Synchronization

2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Shu-Ying Wang ◽  
Jian-Feng Zhao ◽  
Xian-Feng Li ◽  
Li-Tao Zhang
Keyword(s):  
Chaos Synchronization ◽  
Image Transmission ◽  
Encryption Algorithm ◽  
Encryption Scheme ◽  
Secret Key ◽  
Response System ◽  
Plain Image ◽  
Arnold Transformation ◽  
The Relationship ◽  
Synchronization Accuracy

In view of the digital image transmission security, based on laser chaos synchronization and Arnold cat map, a novel image encryption scheme is proposed. Based on pixel values of plain image a parameter is generated to influence the secret key. Sequences of the drive system and response system are pretreated by the same method and make image blocking encryption scheme for plain image. Finally, pixels position are scrambled by general Arnold transformation. In decryption process, the chaotic synchronization accuracy is fully considered and the relationship between the effect of synchronization and decryption is analyzed, which has characteristics of high precision, higher efficiency, simplicity, flexibility, and better controllability. The experimental results show that the encryption algorithm image has high security and good antijamming performance.

scholarly journals Image confusion and diffusion based on multi-chaotic system and mix-column

2021 ◽  
Vol 10 (4) ◽  
pp. 2100-2109
Author(s):  
Amal Abdulbaqi Maryoosh ◽  
Zahraa Salah Dhaif ◽  
Raniah Ali Mustafa
Keyword(s):  
Security Analysis ◽  
Key Space ◽  
Xor Operation ◽  
Chaotic Cryptography ◽  
Plain Image ◽  
Image Pixels ◽  
Encryption Method ◽  
And Diffusion ◽  
Confusion And Diffusion ◽  
Image Encryption Algorithm

In this paper, a new image encryption algorithm based on chaotic cryptography was proposed. The proposed scheme was based on multiple stages of confusion and diffusion. The diffusion process was implemented twice, first, by permuting the pixels of the plain image by using an Arnold cat map and, the second time by permuting the plain image pixels via the proposed permutation algorithm. The confusion process was performed many times, by performing the XOR operation between the two resulted from permuted images, subtracted a random value from all pixels of the image, as well as by implementing the mix column on the resulted image, and by used the Lorenz key to obtain the encrypted image. The security analysis tests that used to exam the results of this encryption method were information entropy, key space analysis, correlation, histogram analysis UACI, and NPCR have shown that the suggested algorithm has been resistant against different types of attacks.

Sign in / Sign up

Export Citation Format

Share Document