scholarly journals On the Security of a Latin-Bit Cube-Based Image Chaotic Encryption Algorithm

Entropy ◽  
2019 ◽  
Vol 21 (9) ◽  
pp. 888 ◽  
Author(s):  
Zeqing Zhang ◽  
Simin Yu
Keyword(s):  
Finite Field ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Statistical Characteristics ◽  
Chaotic Encryption ◽  
Diffusion Stage ◽  
Encryption Schemes ◽  
Secret Keys ◽  
Plain Image ◽  
Equivalent Keys

In this paper, the security analysis of an image chaotic encryption algorithm based on Latin cubes and bit cubes is given. The proposed algorithm adopts a first-scrambling-diffusion- second-scrambling three-stage encryption scheme. First, a finite field is constructed using chaotic sequences. Then, the Latin cubes are generated from finite field operation and used for image chaotic encryption. In addition, according to the statistical characteristics of the diffusion image in the diffusion stage, the algorithm also uses different Latin cube combinations to scramble the diffusion image for the second time. However, the generation of Latin cubes in this algorithm is independent of plain image, while, in the diffusion stage, when any one bit in the plain image changes, the corresponding number of bits in the cipher image follows the change with obvious regularity. Thus, the equivalent secret keys can be obtained by chosen plaintext attack. Theoretical analysis and experimental results indicate that only a maximum of 2 . 5 × w × h 3 + 6 plain images are needed to crack the cipher image with w × h resolution. The size of equivalent keys deciphered by the method proposed in this paper are much smaller than other general methods of cryptanalysis for similar encryption schemes.

scholarly journals Parallel Crossed Chaotic Encryption for Hyperspectral Images

2018 ◽  
Vol 8 (7) ◽  
pp. 1183 ◽  
Author(s):  
Carlos Villaseñor ◽  
Eric Gutierrez-Frias ◽  
Nancy Arana-Daniel ◽  
Alma Alanis ◽  
Carlos Lopez-Franco
Keyword(s):  
Chaotic Systems ◽  
Ad Hoc ◽  
State Of The Art ◽  
Hyperspectral Images ◽  
Encryption Algorithm ◽  
Electromagnetic Spectrum ◽  
Chaotic Encryption ◽  
Raw Data ◽  
Essential Tool ◽  
Encryption Schemes

Hyperspectral images (HI) collect information from across the electromagnetic spectrum, and they are an essential tool for identifying materials, recognizing processes and finding objects. However, the information on an HI could be sensitive and must to be protected. Although there are many encryption schemes for images and raw data, there are not specific schemes for HI. In this paper, we introduce the idea of crossed chaotic systems and we present an ad hoc parallel crossed chaotic encryption algorithm for HI, in which we take advantage of the multidimensionality nature of the HI. Consequently, we obtain a faster encryption algorithm and with a higher entropy result than others state of the art chaotic schemes.

scholarly journals A Secure Image Encryption Algorithm Based on Rubik's Cube Principle

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Khaled Loukhaoukha ◽  
Jean-Yves Chouinard ◽  
Abdellah Berdai
Keyword(s):  
Image Encryption ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Differential Attack ◽  
Rubik's Cube ◽  
Rubik’S Cube ◽  
Secret Keys ◽  
Encryption Algorithms ◽  
Cryptographic Attacks ◽  
Image Encryption Algorithm

In the past few years, several encryption algorithms based on chaotic systems have been proposed as means to protect digital images against cryptographic attacks. These encryption algorithms typically use relatively small key spaces and thus offer limited security, especially if they are one-dimensional. In this paper, we proposed a novel image encryption algorithm based on Rubik's cube principle. The original image is scrambled using the principle of Rubik's cube. Then, XOR operator is applied to rows and columns of the scrambled image using two secret keys. Finally, the experimental results and security analysis show that the proposed image encryption scheme not only can achieve good encryption and perfect hiding ability but also can resist exhaustive attack, statistical attack, and differential attack.

scholarly journals Image Encryption Algorithm Based on Chaotic Economic Model

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
S. S. Askar ◽  
A. A. Karawia ◽  
Ahmad Alshamrani
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Security Analysis ◽  
Correlation Coefficients ◽  
Encryption Algorithm ◽  
Economic Systems ◽  
Plain Image ◽  
Encrypted Images ◽  
Image Encryption Algorithm ◽  
Gray Values

In literature, chaotic economic systems have got much attention because of their complex dynamic behaviors such as bifurcation and chaos. Recently, a few researches on the usage of these systems in cryptographic algorithms have been conducted. In this paper, a new image encryption algorithm based on a chaotic economic map is proposed. An implementation of the proposed algorithm on a plain image based on the chaotic map is performed. The obtained results show that the proposed algorithm can successfully encrypt and decrypt the images with the same security keys. The security analysis is encouraging and shows that the encrypted images have good information entropy and very low correlation coefficients and the distribution of the gray values of the encrypted image has random-like behavior.

scholarly journals An Image Encryption Algorithm Based on Time-Delay and Random Insertion

Entropy ◽  
2018 ◽  
Vol 20 (12) ◽  
pp. 974 ◽  
Author(s):  
Xiaoling Huang ◽  
Guodong Ye
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Experimental Tests ◽  
Encryption Algorithm ◽  
Secure Communications ◽  
Diffusion Structure ◽  
Secret Keys ◽  
Plain Image ◽  
Two Stages ◽  
Image Encryption Algorithm

An image encryption algorithm is presented in this paper based on a chaotic map. Different from traditional methods based on the permutation-diffusion structure, the keystream here depends on both secret keys and the pre-processed image. In particular, in the permutation stage, a middle parameter is designed to revise the outputs of the chaotic map, yielding a temporal delay phenomena. Then, diffusion operation is applied after a group of random numbers is inserted into the permuted image. Therefore, the gray distribution can be changed and is different from that of the plain-image. This insertion acts as a one-time pad. Moreover, the keystream for the diffusion operation is designed to be influenced by secret keys assigned in the permutation stage. As a result, the two stages are mixed together to strengthen entirety. Experimental tests also suggest that our algorithm, permutation– insertion–diffusion (PID), performs better when expecting secure communications for images.

scholarly journals An Improved Piecewise Linear Chaotic Map Based Image Encryption Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yuping Hu ◽  
Congxu Zhu ◽  
Zhijian Wang
Keyword(s):  
Image Encryption ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Pseudorandom Sequences ◽  
Piecewise Linear Chaotic Map ◽  
Key Space ◽  
Plain Image ◽  
Image Encryption Algorithm

An image encryption algorithm based on improved piecewise linear chaotic map (MPWLCM) model was proposed. The algorithm uses the MPWLCM to permute and diffuse plain image simultaneously. Due to the sensitivity to initial key values, system parameters, and ergodicity in chaotic system, two pseudorandom sequences are designed and used in the processes of permutation and diffusion. The order of processing pixels is not in accordance with the index of pixels, but it is from beginning or end alternately. The cipher feedback was introduced in diffusion process. Test results and security analysis show that not only the scheme can achieve good encryption results but also its key space is large enough to resist against brute attack.

scholarly journals On the Cryptanalysis of a Bit-Level Image Chaotic Encryption Algorithm

2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Yingchun Hu ◽  
Simin Yu ◽  
Zeqing Zhang
Keyword(s):  
Simulation Experiment ◽  
Chaotic Map ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Chaotic Encryption ◽  
Original Image ◽  
Chosen Plaintext Attack ◽  
Linear Transform ◽  
Two Stages ◽  
Equivalent Diffusion

In this paper, the security analysis of a bit-level image chaotic encryption algorithm based on the 1D chaotic map is proposed. The original image chaotic encryption algorithm includes bit-level permutation encryption, diffusion encryption, and linear transform. Deciphering of it can be divided into two stages. First, bit-level permutation encryption, diffusion encryption, and linear transform can be simplified into bit-level equivalent permutation encryption and equivalent diffusion encryption, which is a key breakthrough point of cryptanalysis. Second, the chaotic sequence generated by this algorithm is independent of the plaintext image. Therefore, the equivalent diffusion key and the equivalent permutation key can be obtained by chosen-plaintext attack, respectively. Theoretical analysis and numerical simulation experiment results verify the effectiveness of the analytical method. Finally, some suggestions are proposed to promote the security of the original image chaotic encryption algorithm.

A Novel Image Encryption Algorithm Using Multiple Encryption Techniques for Mobile Devices

2020 ◽  
Vol 10 (2) ◽  
pp. 123-142
Author(s):  
Showkat Ahmad Bhat ◽  
Amandeep Singh
Keyword(s):  
Wireless Communication ◽  
Communication Networks ◽  
Image Encryption ◽  
High Speed ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Multiple Encryption ◽  
Communication Devices ◽  
Cryptographic Attacks ◽  
Image Encryption Algorithm

Background & Objective: Digital multimedia exchange between different mobile communication devices has increased rapidly with the invention of the high-speed data services like LTE-A, LTE, and WiMAX. However, there are always certain security risks associated with the use of wireless communication technologies. Methods: To protect the digital images against cryptographic attacks different image encryption algorithms are being employed in the wireless communication networks. These algorithms use comparatively less key spaces and accordingly offer inadequate security. The proposed algorithm described in this paper based on Rubik’s cube principle because of its high confusion and diffusion properties, Arnold function having effective scrambling power, blocking cipher with block encryption and permutation powers. The main strength of the proposed algorithm lies in the large key spaces and the combination of different high power encryption techniques at each stage of algorithm. The different operations employed on the image are with four security keys of different key spaces at multiple stages of the algorithm. Results & Conclusion: Finally, the effectiveness and the security analysis results shows that the proposed image encryption algorithm attains high encryption and security capabilities along with high resistance against cryptanalytic attacks, differential attacks and statistical attacks.

scholarly journals Security Analysis and Improvement of an Image Encryption Cryptosystem Based on Bit Plane Extraction and Multi Chaos

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 505
Author(s):  
Shuqin Zhu ◽  
Congxu Zhu
Keyword(s):  
Image Encryption ◽  
Random Sequence ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Original Algorithm ◽  
Plane Extraction ◽  
Bit Plane ◽  
Bit Planes ◽  
And Diffusion ◽  
Improved Algorithm

This paper analyzes the security of image encryption systems based on bit plane extraction and multi chaos. It includes a bit-level permutation for high, 4-bit planes and bit-wise XOR diffusion, and finds that the key streams in the permutation and diffusion phases are independent of the plaintext image. Therefore, the equivalent diffusion key and the equivalent permutation key can be recovered by the chosen-plaintext attack method, in which only two special plaintext images and their corresponding cipher images are used. The effectiveness and feasibility of the proposed attack algorithm is verified by a MATLAB 2015b simulation. In the experiment, all the key streams in the original algorithm are cracked through two special plaintext images and their corresponding ciphertext images. In addition, an improved algorithm is proposed. In the improved algorithm, the generation of a random sequence is related to ciphertext, which makes the encryption algorithm have the encryption effect of a “one time pad”. The encryption effect of the improved algorithm is better than that of the original encryption algorithm in the aspects of information entropy, ciphertext correlation analysis and ciphertext sensitivity analysis.

scholarly journals Adaptive Chaotic Image Encryption Algorithm Based on RNA and Pixel Depth

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1770
Author(s):  
Xiaoqiang Zhang ◽  
Xuangang Yan
Keyword(s):  
Image Encryption ◽  
Three Dimensional ◽  
Encryption Algorithm ◽  
Current Time ◽  
Plain Image ◽  
Scope Of Application ◽  
Selective Diffusion ◽  
Chaotic Image Encryption ◽  
And Diffusion ◽  
Image Encryption Algorithm

To prevent the leakage of image content, image encryption technology has received increasing attention. Most current algorithms are only suitable for the images of certain types and cannot update keys in a timely manner. To tackle such problems, we propose an adaptive chaotic image encryption algorithm based on RNA and pixel depth. Firstly, a novel chaotic system, two-dimensional improved Logistic-adjusted-Sine map is designed. Then, we propose a three-dimensional adaptive Arnold transform for scrambling. Secondly, keys are generated by the hash values of the plain image and current time to achieve one-image, one-key, and one-time pad simultaneously. Thirdly, we build a pre-permuted RNA cube for 3D adaptive scrambling by pixel depth, chaotic sequences, and adaptive RNA coding. Finally, selective diffusion combined with pixel depth and RNA operations is performed, in which the RNA operators are determined by the chemical structure and properties of amino acids. Pixel depth is integrated into the whole procedure of parameter generation, scrambling, and diffusion. Experiments and algorithm analyses show that our algorithm has strong security, desirable performance, and a broader scope of application.

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