Digital image scrambling based on elementary cellular automata

Dalhoum, Abdel Latif Abu; Madain, Alia; Hiary, Hazem

doi:10.1007/s11042-015-2972-z

Cited by 22 publications

(10 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…6 (a) is scrambled using the proposed scrambling scheme based on ECA. Meanwhile, we also compute GDDs of the scrambled images using Arnold scrambling, CA [17] and the traditional ECA [19] to compare with our proposed scrambling scheme as shown in Fig. 11.…”

Section: The Scrambling Performance Of the Proposed Scrambling Methodmentioning

confidence: 99%

“…However, the number of cells was equal to that of the pixel of the image in scrambling methods based on CA, which results in high storage requirement and multiple logical operations. Dalhoum and Madain presented a scrambling method based on elementary CA (ECA), where an 1-D CA was adopted to generate the key in order to permutate pixels [19]. Nevertheless, an ECA used in scrambling causes less randomness.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Image encryption and compression based on kronecker compressed sensing and elementary cellular automata scrambling

Chen

Zhang

et al. 2016

Optics & Laser Technology

View full text Add to dashboard Cite

Section: The Scrambling Performance Of the Proposed Scrambling Methodmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Image encryption and compression based on kronecker compressed sensing and elementary cellular automata scrambling

Chen

Zhang

et al. 2016

Optics & Laser Technology

View full text Add to dashboard Cite

“…Image confusion using intertwining logistic map and diffusion using reversible CA (RCA) is suggested 14 . A digital scrambling according to four classes of behaviours proposed by wolfram such as ordered behaviour, periodic behaviour, random or chaotic behaviour and complex behaviour is proposed 15 . This CA is most widely used for diffusion operation and confusion process has been carried out with logistic map and chaos memory combinations [16][17][18] .…”

Section: Introductionmentioning

confidence: 99%

Cellular Automata with Synthetic Image A Secure Image Communication with Transform Domain

et al. 2019

View full text Add to dashboard Cite

Image encryption has attained a great attention due to the necessity to safeguard confidential images. Digital documents, site images, battlefield photographs, etc. need a secure approach for sharing in an open channel. Hardware – software co-design is a better option for exploiting unique features to cipher the confidential images. Cellular automata (CA) and synthetic image influenced transform domain approach for image encryption is proposed in this paper. The digital image is initially divided into four subsections by applying integer wavelet transform. Confusion is accomplished on low – low section of the transformed image using CA rules 90 and 150. The first level of diffusion with consecutive XORing operation of image pixels is initiated by CA rule 42. A synthetic random key image is developed by extracting true random bits generated by Cyclone V field programmable gate array 5CSEMA5F31C6. This random image plays an important role in second level of diffusion. The proposed confusion and two level diffusion assisted image encryption approach has been validated through the entropy, correlation, histogram, number of pixels change rate, unified average change intensity, contrast and encryption quality analyses.

show abstract

“…Recently Ye and Li (2008), Dalhoum et al (2012), Qadir et al (2012), and Dalhoum et al (2015) proposed cellular automata (CA)-based DIS techniques. CA is time and space discrete model and is composed of a grid of cells, interconnected locally with each other.…”

Section: Introductionmentioning

confidence: 99%

Cellular automata-based approach for digital image scrambling

Jeelani

Qadir

2018

IJICC

View full text Add to dashboard Cite

Purpose The purpose of this paper is to investigate two-dimensional outer totalistic cellular automata (2D-OTCA) rules other than the Game of Life rule for image scrambling. This paper presents a digital image scrambling (DIS) technique based on 2D-OTCA for improving the scrambling degree. The comparison of scrambling performance and computational effort of proposed technique with existing CA-based image scrambling techniques is also presented. Design/methodology/approach In this paper, a DIS technique based on 2D-OTCA with von Neumann neighborhood (NvN) is proposed. Effect of three important cellular automata (CA) parameters on gray difference degree (GDD) is analyzed: first the OTCA rules, afterwards two different boundary conditions and finally the number of CA generations (k) are tested. The authors selected a random sample of gray-scale images from the Berkeley Segmentation Data set and Benchmark, BSDS300 (www2.eecs.berkeley.edu/Research/Projects/CS/vision/bsds/) for the experiments. Initially, the CA is setup with a random initial configuration and the GDD is computed by testing all OTCA rules, one by one, for CA generations ranging from 1 to 10. A subset of these tested rules produces high GDD values and shows positive correlation with the k values. Subsequently, this sample of rules is used with different boundary conditions and applied to the sample image data set to analyze the effect of these boundary conditions on GDD. Finally, in order to compare the scrambling performance of the proposed technique with the existing CA-based image scrambling techniques, the authors use same initial CA configuration, number of CA generations, k=10, periodic boundary conditions and the same test images. Findings The experimental results are evaluated and analyzed using GDD parameter and then compared with existing techniques. The technique results in better GDD values with 2D-OTCA rule 171 when compared with existing techniques. The CPU running time of the proposed algorithm is also considerably small as compared to existing techniques. Originality/value In this paper, the authors focused on using von Neumann neighborhood (NvN) to evolve the CA for image scrambling. The use of NvN reduced the computational effort on one hand, and reduced the CA rule space to 1,024 as compared to about 2.62 lakh rule space available with Moore neighborhood (NM) on the other. The results of this paper are based on original analysis of the proposed work.

show abstract

Digital image scrambling based on elementary cellular automata

Cited by 22 publications

References 26 publications

Image encryption and compression based on kronecker compressed sensing and elementary cellular automata scrambling

Image encryption and compression based on kronecker compressed sensing and elementary cellular automata scrambling

Cellular Automata with Synthetic Image A Secure Image Communication with Transform Domain

Cellular automata-based approach for digital image scrambling

Contact Info

Product

Resources

About