Chaotic image encryption algorithm based on pseudo-random bit sequence and DNA plane

2019 ◽  
Vol 33 (22) ◽  
pp. 1950263 ◽  
Author(s):  
Xingyuan Wang ◽  
Hongyu Zhao ◽  
Yutao Hou ◽  
Chao Luo ◽  
Yingqian Zhang ◽  
...  

In this paper, a new chaotic image encryption algorithm based on pseudo-random bit sequence and DNA plane is proposed. The coupled map lattice (CML) is applied to design a pseudo-random bit sequence generation (PBSG) system and use the system to generate the random sequence needed in the encryption process. The initial values and parameters of the system are generated by the SHA-256 hash algorithm combined with given keys. Firstly, the plane image is decomposed into four DNA planes in combination with the DNA encoding rules, and then the four DNA planes are subjected to row circular permutation and column circular permutation. After that, the diffusion operation on each DNA plane is performed. Finally, the four DNA planes are decoded and then combined into a pixel matrix, that is, the final cipher image is obtained. Throughout the encryption process, the choice of DNA encoding and decoding rules is determined by the PBSG system. Simulation results and security analysis show that the algorithm not only has good encryption effect, but also can resist various classic attacks, and has excellent security performance.

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Jian Zhang ◽  
DongXin Fang ◽  
Honge Ren

We propose a new image encryption algorithm based on DNA sequences combined with chaotic maps. This algorithm has two innovations: (1) it diffuses the pixels by transforming the nucleotides into corresponding base pairs a random number of times and (2) it confuses the pixels by a chaotic index based on a chaotic map. For any size of the original grayscale image, the rows and columns are fist exchanged by the arrays generated by a logistic chaotic map. Secondly, each pixel that has been confused is encoded into four nucleotides according to the DNA coding. Thirdly, each nucleotide is transformed into the corresponding base pair a random number of time(s) by a series of iterative computations based on Chebyshev’s chaotic map. Experimental results indicate that the key account of this algorithm is 1.536 × 10127, the correlation coefficient of a 256 × 256 Lena image between, before, and after the encryption processes was 0.0028, and the information entropy of the encrypted image was 7.9854. These simulation results and security analysis show that the proposed algorithm not only has good encryption effect, but also has the ability to repel exhaustive, statistical, differential, and noise attacks.


2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Xuncai Zhang ◽  
Feng Han ◽  
Ying Niu

With the help of the fact that chaos is sensitive to initial conditions and pseudorandomness, combined with the spatial configurations in the DNA molecule’s inherent and unique information processing ability, a novel image encryption algorithm based on bit permutation and dynamic DNA encoding is proposed here. The algorithm first uses Keccak to calculate the hash value for a given DNA sequence as the initial value of a chaotic map; second, it uses a chaotic sequence to scramble the image pixel locations, and the butterfly network is used to implement the bit permutation. Then, the image is coded into a DNA matrix dynamic, and an algebraic operation is performed with the DNA sequence to realize the substitution of the pixels, which further improves the security of the encryption. Finally, the confusion and diffusion properties of the algorithm are further enhanced by the operation of the DNA sequence and the ciphertext feedback. The results of the experiment and security analysis show that the algorithm not only has a large key space and strong sensitivity to the key but can also effectively resist attack operations such as statistical analysis and exhaustive analysis.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Xuncai Zhang ◽  
Tao Wu ◽  
Yanfeng Wang ◽  
Liying Jiang ◽  
Ying Niu

To realize the safe transmission of images, a chaotic image encryption algorithm based on Latin square and random shift is proposed. The algorithm consists of four parts: key generation, pixel scrambling, pixel replacement, and bit scrambling. Firstly, the key is generated from the plain image to improve the sensitivity of the encryption method. Secondly, each pixel in each row of the image matrix is moved cyclically to the right, in turn, to change the position of the image pixel and realize pixel position scrambling. Then, a 256-order Latin square matrix composed of a chaotic sequence is used as a lookup table, and the replacement coordinates are calculated based on the image pixel value and the chaotic sequence value, replacing the corresponding coordinate elements in the image matrix. Finally, decompose the bitplane of the image matrix and combine it into two-bit matrices, scramble the two bit matrices, respectively, with the Latin square matrix, recombine the scrambled two-bit matrices, and convert them into decimal to obtain the ciphertext image. In the proposed encryption method, all the Latin square matrices used are generated by chaotic sequences, further enhancing the complexity of the generated Latin square matrix and improving the algorithm’s security. Experimental results and security analysis show that the proposed algorithm has good security performance and is suitable for image encryption.


Author(s):  
Showkat Ahmad Bhat ◽  
Amandeep Singh

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.


Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 505
Author(s):  
Shuqin Zhu ◽  
Congxu Zhu

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.


Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1770
Author(s):  
Xiaoqiang Zhang ◽  
Xuangang Yan

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.


Sign in / Sign up

Export Citation Format

Share Document