Digital Image Encryption Based on Chaotic Cellular Automata

Author(s):  
Zubair Jeelani

Cellular automata are dynamical systems, discrete in terms of both space and time. Many cellular automata are capable of generating chaos and are well suited for applications like digital image encryption and scrambling. Various cellular automata-based digital image scrambling techniques have been proposed in literature. An adversary may have access to a set of images from which the particular image is scrambled. The problem with these techniques in this particular case is that an adversary may be able to find out the true content of the scrambled image just by comparing its histogram with the histograms of a suspected set of images. In this paper, a secure digital image encryption technique based on outer totalistic cellular automata is proposed that modifies the histogram of the scrambled image so that it is difficult to guess the true content carried in the digital image.

2012 ◽  
Vol 19 (4) ◽  
pp. 28-36 ◽  
Author(s):  
Abdel Latif Abu Dalhoum ◽  
Basel A. Mahafzah ◽  
Aiman Ayyal Awwad ◽  
Ibraheem Aldhamari ◽  
Alfonso Ortega ◽  
...  

2011 ◽  
Vol 135-136 ◽  
pp. 231-236
Author(s):  
Rui Liu ◽  
Xiao Ping Tian

Image scrambling is an important technique in digital image encryption and digital image watermarking. This paper proposes a new image scrambling method, which based on chaotic sequence and space-bit-plane operation (SBPO). First, every eight pixels from different areas of image were selected according to chaotic sequence, and grouped together to form a collection. Second, the SBPO was performed in every collection and built eight pixels of the image with new values. The scrambling image was generated when all pixels were processed. This method can scramble image not only based on the pixel’s position but also the value and their corresponding probability. The experimental results show that this scrambling method possesses perfect confusion properties and it can resist various attacks.


2015 ◽  
Vol 75 (24) ◽  
pp. 17019-17034 ◽  
Author(s):  
Abdel Latif Abu Dalhoum ◽  
Alia Madain ◽  
Hazem Hiary

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 816 ◽  
Author(s):  
A. Martín del Rey ◽  
R. Casado Vara ◽  
D. Hernández Serrano

The aim of this work is to completely solve the reversibility problem for symmetric linear cellular automata with radius r = 3 and null boundary conditions. The main result obtained is the explicit computation of the local transition functions of the inverse cellular automata. This allows introduction of possible and interesting applications in digital image encryption.


Sign in / Sign up

Export Citation Format

Share Document