A Partial Ligt-weight Image Encryption Scheme

Ahmad, Jawad; Tahir, Ahsen; Khan, Jan Sher; Khan, Muazzam A.; Khan, Fadia Ali; Ali, Arshad; Habib, Zeeshan

doi:10.1109/ucet.2019.8881887

Cited by 10 publications

(36 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…8 (a, c, e, g). The simulation results are contrasted with the algorithms presented in [43], [18] and [33] to prove the efficiency of the scheme proposed in this paper. For demonstration purposes, the image after every stage is shown for the Baboon image only in Fig.…”

Section: Experimental Results and Security Analysismentioning

confidence: 99%

“…Lower values of χ2 shows that the pixel distribution is uniform. The chi-square values for the encrypted images are tabulated in Table 4 and are also compared with the schemes proposed in [43], [18] and [33]. It is clear from Table 4 that the encrypted images obtained through the proposed algorithms have uniform pixel distribution and have successfully covered all the data from the hackers.…”

Section: A Histogram and Chi-square Investigationmentioning

confidence: 99%

“…Citation information: DOI 10.1109/ACCESS.2020.3012912, IEEE Access process is carried out with a source that emits 2 8 symbols and all of them can occur with equal probability, the ideal entropy value will be 8 but practically it is a value close to 8. The entropy H(m) values of the test images for both plaintext and ciphertext images and that of [43], [18] and [33] are tabulated in Table 5. It can be seen from Table 5 that the values of entropy for the ciphertext images of all four test images are very close to 8 for the proposed algorithm and are greater than the algorithms proposed in [43], [18] and [33].…”

Section: B Information Entropymentioning

confidence: 99%

“…The entropy H(m) values of the test images for both plaintext and ciphertext images and that of [43], [18] and [33] are tabulated in Table 5. It can be seen from Table 5 that the values of entropy for the ciphertext images of all four test images are very close to 8 for the proposed algorithm and are greater than the algorithms proposed in [43], [18] and [33]. Furthermore, the local entropy defined in [61] is calculated for all encrypted images.…”

Section: B Information Entropymentioning

confidence: 99%

“…Jawad et al [32] have utilized orthogonal matrices, skew tent map and XOR operation to design an efficient encryption algorithm for images. A light weight image encryption scheme has also been proposed using Chebyshev and Intertwining maps encrypting a small portion of the transformed image for the applications where time is a constraint [33]. An efficient cryptosystem is proposed by Masood et al in [24] employing fractal keys and a Lorenz chaotic map.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Chaos-Based Confusion and Diffusion of Image Pixels Using Dynamic Substitution

et al. 2020

Self Cite

View full text Add to dashboard Cite

The evolution of wireless and mobile communication from 0G to the upcoming 5G gives rise to data sharing through the Internet. This data transfer via open public networks are susceptible to several types of attacks. Encryption is a method that can protect information from hackers and hence confidential data can be secured through a cryptosystem. Due to the increased number of cyber attacks, encryption has become an important component of modern-day communication. In this paper, a new image encryption algorithm is presented using chaos theory and dynamic substitution. The proposed scheme is based on two dimensional Henon, Ikeda chaotic maps, and substitution box (S-box) transformation. Through Henon, a random S-Box is selected and the image pixel is substituted randomly. To analyze security and robustness of the proposed algorithm, several security tests such as information entropy, histogram investigation, correlation analysis, energy, homogeneity, and mean square error are performed. The entropy values of the test images are greater than 7.99 and the key space of the proposed algorithm is 2 798. Furthermore, the correlation values of the encrypted images using the the proposed scheme are close to zero when compared with other conventional schemes. The number of pixel change rate (NPCR) and unified average change intensity (UACI) for the proposed scheme are higher than 99.50% and 33, respectively. The simulation results and comparison with the state-of-the-art algorithms prove the efficiency and security of the proposed scheme.

show abstract

Section: Experimental Results and Security Analysismentioning

confidence: 99%

Section: A Histogram and Chi-square Investigationmentioning

confidence: 99%

Section: B Information Entropymentioning

confidence: 99%

Section: B Information Entropymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Chaos-Based Confusion and Diffusion of Image Pixels Using Dynamic Substitution

et al. 2020

Self Cite

View full text Add to dashboard Cite

show abstract

A noise-tolerant cryptosystem based on the decomposition of bit-planes and the analysis of chaotic gauss iterated map

Shafique

2022

Neural Comput & Applic

View full text Add to dashboard Cite

DNA Strands Level Scrambling Based Color Image Encryption Scheme

et al. 2020

View full text Add to dashboard Cite

In the past, many image encryption schemes have been developed through the swapping operations at the different levels of granularity. These levels span bits, Deoxyribonucleic acid (DNA) molecules, pixels, blocks of pixels. In this study, a new scheme for the encryption of color images based on the DNA strands level scrambling (DNASLS) and chaotic system has been proposed. After a color image is input, it is decomposed into the red, green and blue components. After it, these components are merged to form a big single image. Intertwining logistic map (ILM) has been used for the random data which generates three streams of random numbers. These streams have been further manipulated in such a way that nine streams are spawned out of them. One stream out of these nine streams has been used for the generation of a key image. Two streams have been used to DNA-encode the big single image and the key image. Afterwards, the strands of DNA-encoded single image are swapped with each other. Four streams determine the addresses of two DNA encoded pixels for the selection. A yet another stream is being used to select a particular strand from the DNA strands. To create the diffusion effects, an XOR operation has been done between the DNA encoded image after the swapping of strands and the DNA encoded key image. Finally, the last and ninth stream has been used to decode the DNA-encoded pixels into the decimal form. Purely random numbers with no interdependence have been employed in the entire encryption process. The effects of plaintext sensitivity have been achieved through the incorporation of Secure Hash Algorithm-256 or SHA-256 hash codes. In the end, the experiment and the security analysis have been performed. The results of the validation metrics like information entropy(7.9973), average key sensitivity(99.61%) and mean absolute error(84.7158) demonstrate the security, defiance to the number of attacks and a potential for real world application of the proposed image cipher.

show abstract

A Partial Ligt-weight Image Encryption Scheme

Cited by 10 publications

References 16 publications

Chaos-Based Confusion and Diffusion of Image Pixels Using Dynamic Substitution

Chaos-Based Confusion and Diffusion of Image Pixels Using Dynamic Substitution

A noise-tolerant cryptosystem based on the decomposition of bit-planes and the analysis of chaotic gauss iterated map

DNA Strands Level Scrambling Based Color Image Encryption Scheme

Contact Info

Product

Resources

About