scholarly journals Image Encryption Scheme Based on Balanced Two-Dimensional Cellular Automata

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Xiaoyan Zhang ◽  
Chao Wang ◽  
Sheng Zhong ◽  
Qian Yao
Keyword(s):  
Cellular Automata ◽  
Image Encryption ◽  
Random Number Generator ◽  
Encryption Scheme ◽  
Two Dimensional ◽  
Random Image ◽  
Key Space ◽  
Plain Image ◽  
Ca Model ◽  
Encryption Decryption

Cellular automata (CA) are simple models of computation which exhibit fascinatingly complex behavior. Due to the universality of CA model, it has been widely applied in traditional cryptography and image processing. The aim of this paper is to present a new image encryption scheme based on balanced two-dimensional cellular automata. In this scheme, a random image with the same size of the plain image to be encrypted is first generated by a pseudo-random number generator with a seed. Then, the random image is evoluted alternately with two balanced two-dimensional CA rules. At last, the cipher image is obtained by operating bitwise XOR on the final evolution image and the plain image. This proposed scheme possesses some advantages such as very large key space, high randomness, complex cryptographic structure, and pretty fast encryption/decryption speed. Simulation results obtained from some classical images at the USC-SIPI database demonstrate the strong performance of the proposed image encryption scheme.

A Fast Encryption Scheme Suitable for Video Surveillance Applications Using SHA-256 Hash Function and 1D Sine–Sine Chaotic Map

2020 ◽  
pp. 2150022
Author(s):  
Kirtee Panwar ◽  
Ravindra Kumar Purwar ◽  
Garima Srivastava
Keyword(s):  
Video Surveillance ◽  
Image Encryption ◽  
Chaotic Map ◽  
Encryption Scheme ◽  
Internal Working ◽  
Key Space ◽  
Higher Dimensional ◽  
Secret Keys ◽  
Plain Image ◽  
Surveillance Applications

This paper proposes an image encryption technique which is fast and secure. The encryption scheme is designed for secure transmission of video surveillance data (keyframes) over insecure network. The image encryption technique employs 1D Sine–Sine system with better chaotic properties than its seed map and faster than higher-dimensional chaotic systems. Further, design of encryption scheme is based on two permutation rounds, which employs pixel swapping operation and diffusion operation which is simple and provides required security against plaintext, differential and various other attacks. Three separate chaotic sequences are generated using 1D Sine–Sine system which enhances the key space of the encryption scheme. Secret keys are updated dynamically with SHA-256 hash value obtained from plain image. Hash values of plain image are efficiently used without loss of any hash value information. This makes the encryption scheme plaintext sensitive and secure against plaintext attacks. Performance and security aspects of encryption scheme is analyzed both quantitatively using predefined security metrics and qualitatively by scrutinizing the internal working of encryption scheme. Computational complexity of encrypting a plain image of size [Formula: see text] is [Formula: see text] and is suitable for encrypting keyframes of video for secure surveillance applications.

scholarly journals An Efficient Plaintext-Related Chaotic Image Encryption Scheme Based on Compressive Sensing

Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 758
Author(s):  
Zhen Li ◽  
Changgen Peng ◽  
Weijie Tan ◽  
Liangrong Li
Keyword(s):  
Compressive Sensing ◽  
Image Encryption ◽  
Chaotic Map ◽  
Coefficient Matrix ◽  
Security And Privacy ◽  
Encryption Scheme ◽  
Two Dimensional ◽  
Comparison Results ◽  
Plain Image ◽  
Chaotic Image Encryption

With the development of mobile communication network, especially 5G today and 6G in the future, the security and privacy of digital images are important in network applications. Meanwhile, high resolution images will take up a lot of bandwidth and storage space in the cloud applications. Facing the demands, an efficient and secure plaintext-related chaotic image encryption scheme is proposed based on compressive sensing for achieving the compression and encryption simultaneously. In the proposed scheme, the internal keys for controlling the whole process of compression and encryption is first generated by plain image and initial key. Subsequently, discrete wavelets transform is used in order to convert the plain image to the coefficient matrix. After that, the permutation processing, which is controlled by the two-dimensional Sine improved Logistic iterative chaotic map (2D-SLIM), was done on the coefficient matrix in order to make the matrix energy dispersive. Furthermore, a plaintext related compressive sensing has been done utilizing a measurement matrix generated by 2D-SLIM. In order to make the cipher image lower correlation and distribute uniform, measurement results quantified the 0∼255 and the permutation and diffusion operation is done under the controlling by two-dimensional Logistic-Sine-coupling map (2D-LSCM). Finally, some common compression and security performance analysis methods are used to test our scheme. The test and comparison results shown in our proposed scheme have both excellent security and compression performance when compared with other recent works, thus ensuring the digital image application in the network.

A Color Image Encryption Scheme Based on a Hybrid Cascaded Chaotic System

2021 ◽  
Vol 31 (09) ◽  
pp. 2150125
Author(s):  
Shanshan Cheng ◽  
Jingru Sun ◽  
Cong Xu
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Color Image ◽  
Initial Conditions ◽  
Encryption Scheme ◽  
Color Image Encryption ◽  
Chaotic Sequences ◽  
Key Space ◽  
Plain Image ◽  
Sensitivity To Initial Conditions

As image is an important way of information representation, researchers pay more and more attention on image encryption. In order to improve the performance of image encryption, a novel image encryption scheme based on a hybrid cascaded chaotic system and sectoral segmentation is proposed in this paper. Hybrid cascaded chaotic system has a larger key space, higher complexity, more sensitivity to initial conditions. Four chaotic sequences relevant to a plain image are generated by this system, which strengthen plaintext correlation and the randomness. During the scrambling process, sectoral segmentation focuses on how to extract a sequence from the disk storing data, which can not only reduce the correlation between the three components of the image, but also hide image information to a large extent. Further, a DNA algorithm is used in the diffusion process. Simulation shows that the proposed scheme can effectively resist various attacks and improve the encryption performance.

An Image Encryption Scheme Based on Generalized Arnold Map and Chinese Remainder Theorem

2014 ◽  
Vol 1049-1050 ◽  
pp. 1371-1374
Author(s):  
Rui Song Ye ◽  
Ming Ye ◽  
Hao Qi Yao ◽  
Wen Hao Ye
Keyword(s):  
Image Encryption ◽  
Chinese Remainder Theorem ◽  
Chaotic Sequence ◽  
Video Communication ◽  
Encryption Scheme ◽  
Avalanche Effect ◽  
Key Space ◽  
Plain Image ◽  
Key Sensitivity ◽  
Arnold Map

A novel image encryption scheme comprising of one permutation process and one diffusion process is proposed. In the permutation process, the image sized is expanded to one sized by dividing the plain-image into two parts: one consisting of the higher 4bits and one consisting of the lower 4bits. The permutation operations are done row-by-row and column-by-column to increase the speed. The chaotic generalized Arnold map is utilized to generate chaotic sequence, which is quantized to shuffle the expanded image. The chaotic sequence for permutation process is dependent on plain-image and cipher keys, resulting in good key sensitivity and plain-image sensitivity. To achieve more avalanche effect and larger key space, Chinese Remainder Theorem is applied to diffuse the shuffled image. The key sensitivity and key space of the proposed image encryption have been analyzed as well. The experimental results suggest that the proposed image encryption scheme can be used for secure image and video communication applications.

IESCA: An efficient image encryption scheme using 2-D cellular automata

2021 ◽  
Vol 61 ◽  
pp. 102919
Author(s):  
Satyabrata Roy ◽  
Manu Shrivastava ◽  
Umashankar Rawat ◽  
Chirag Vinodkumar Pandey ◽  
Sanjeet Kumar Nayak
Keyword(s):  
Cellular Automata ◽  
Image Encryption ◽  
Encryption Scheme

scholarly journals Design of a Hybrid Programmable 2-D Cellular Automata Based Pseudo Random Number Generator

2020 ◽  
Vol 8 (6) ◽  
pp. 5741-5748
Keyword(s):  
Cellular Automata ◽  
Random Number ◽  
Hamming Distance ◽  
Random Number Generator ◽  
Number Generator ◽  
Two Dimensional ◽  
Pseudo Random Number ◽  
Rule Set ◽  
Initial Seed ◽  
Pseudo Random Number Generator

This paper proposes a hybrid programmable two-dimensional Cellular Automata (CA) based pseudo-random number generator which includes a newly designed rule set. The properties and evolution of one and two dimensional CA are revisited. The various metrics for evaluating CA as a Pseudo-Random Number Generator (PRNG) are discussed. It is proved that the randomness is high irrespective of the initial seed by applying this newly designed rule set. The PRNG is tested against a popular statistical test called Diehard test suite and the results show that the PRNG is highly random. The chaotic measures like entropy, hamming distance and cycle length have been measured

scholarly journals Cryptanalysis of a New Chaotic Image Encryption Technique Based on Multiple Discrete Dynamical Maps

Entropy ◽  
2021 ◽  
Vol 23 (12) ◽  
pp. 1581
Author(s):  
Haiju Fan ◽  
Chenjiu Zhang ◽  
Heng Lu ◽  
Ming Li ◽  
Yanfang Liu
Keyword(s):  
Image Encryption ◽  
Strong Correlation ◽  
Digital Images ◽  
Computational Cost ◽  
Encryption Scheme ◽  
Discrete Dynamic ◽  
Diffusion Structure ◽  
Plain Image ◽  
Simulation Results ◽  
Chaotic Image Encryption

Recently, a new chaotic image encryption technique was proposed based on multiple discrete dynamic maps. The authors claim that the scheme can provide excellent privacy for traditional digital images. However, in order to minimize the computational cost, the encryption scheme adopts one-round encryption and a traditional permutation–diffusion structure. Through cryptanalysis, there is no strong correlation between the key and the plain image, which leads to the collapse of cryptosystem. Based on this, two methods of chosen-plaintext attacks are proposed in this paper. The two methods require 3 pairs and 258 pairs of plain and cipher images, respectively, to break the original encryption system. The simulation results show the effectiveness of the two schemes.

scholarly journals An Algorithm of Image Encryption Using Logistic and Two-Dimensional Chaotic Economic Maps

Entropy ◽  
2019 ◽  
Vol 21 (1) ◽  
pp. 44 ◽  
Author(s):  
Sameh Askar ◽  
Abdel Karawia ◽  
Abdulrahman Al-Khedhairi ◽  
Fatemah Al-Ammar
Keyword(s):  
Image Encryption ◽  
Security Level ◽  
Two Dimensional ◽  
Secret Key ◽  
Large Space ◽  
Cryptographic Algorithm ◽  
Key Space ◽  
Contrast Analysis ◽  
Encryption Algorithms ◽  
Made In

In the literature, there are many image encryption algorithms that have been constructed based on different chaotic maps. However, those algorithms do well in the cryptographic process, but still, some developments need to be made in order to enhance the security level supported by them. This paper introduces a new cryptographic algorithm that depends on a logistic and two-dimensional chaotic economic map. The robustness of the introduced algorithm is shown by implementing it on several types of images. The implementation of the algorithm and its security are partially analyzed using some statistical analyses such as sensitivity to the key space, pixels correlation, the entropy process, and contrast analysis. The results given in this paper and the comparisons performed have led us to decide that the introduced algorithm is characterized by a large space of key security, sensitivity to the secret key, few coefficients of correlation, a high contrast, and accepted information of entropy. In addition, the results obtained in experiments show that our proposed algorithm resists statistical, differential, brute-force, and noise attacks.

Sign in / Sign up

Export Citation Format

Share Document