3C3R, an Image Encryption Algorithm Based on BBI, 2D-CA, and SM-DNA

Khan, Sajid; Han, Lei; Mudassir, Ghulam; Guehguih, Bachira; Ullah, Hidayat

doi:10.3390/e21111075

Cited by 5 publications

(3 citation statements)

References 101 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 17 contains the PSNR, NPCR, and UACI values of the Lena image for different cropped portion, while Table 18 carries the comparison of the occlusion test for the Lena image. The PSNR, MSE, and UACI of the recovered images are better than References 68,76. While NPCR value is comparable with those algorithms.…”

Section: Results and Security Analysismentioning

confidence: 70%

Security of multimedia communication with game trick based fast, efficient, and robust color‐/gray‐scale image encryption algorithm

Khan

Han

Qian

et al. 2020

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

Freshly, an innumerable chaotic system based complex and more time‐consuming image encryption algorithms have been proposed. The majority of those have scrambling and diffusion like two phases or rounds before performing the actual encryption, which leads toward extra time consumption. So unlike those, this article presents a novel image encryption algorithm that is based on game trick. The proposed novel method is DNA based and it can accomplish dual function with one round, that is, scrambling for the bit planes and diffusion for the pixels, So we called it as DNA‐SPD. First of all, a random matrix equivalent to the size of the original image is generated through a python random array generator and seed value of the 512‐bit hexadecimal key of the original image. Second, it performs the pixel adaptive additions with MA between pixels of a plain image, random matrix, the integer value of the hash key entity, and the decimal number (DN). Third, it extracts each channel from the color image and convert it into the binary bit planes, then transformed it into the DNA bit planes through particular DNA rules. Finally, a universal DNA rule utilized to get back encrypted pixels. Various security analysis and comparison of projected results show that the proposed novel encryption method gives better results in a lesser amount of time. The proposed algorithm is robust against the well‐known and effective attacks, that is, known/chosen plaintext attacks, differential attacks, and the statistical attacks. Therefore, the proposed algorithm is more secure and reliable for the security of image communication.

show abstract

Section: Results and Security Analysismentioning

confidence: 70%

Security of multimedia communication with game trick based fast, efficient, and robust color‐/gray‐scale image encryption algorithm

Khan

Han

Qian

et al. 2020

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

show abstract

“…Table 9 lists a comparison of the PSNR and MSE of the Lena image with different cropped portions. The higher PSNR values and lower MSE values, as compared to [64,68], prove that proposed algorithm can retrieve images without losing substantial information. (g) retrieved image of (a); (h) retrieved image of (b); (i) retrieved image of (c); (j) retrieved image of (d); (k) retrieved image of (e); (l) retrieved image of (f).…”

Section: Robustness Against Occlusion Attackmentioning

confidence: 84%

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Butt

Khan

et al. 2020

Entropy

Self Cite

View full text Add to dashboard Cite

Bit-level and pixel-level methods are two classifications for image encryption, which describe the smallest processing elements manipulated in diffusion and permutation respectively. Most pixel-level permutation methods merely alter the positions of pixels, resulting in similar histograms for the original and permuted images. Bit-level permutation methods, however, have the ability to change the histogram of the image, but are usually not preferred due to their time-consuming nature, which is owed to bit-level computation, unlike that of other permutation techniques. In this paper, we introduce a new image encryption algorithm which uses binary bit-plane scrambling and an SPD diffusion technique for the bit-planes of a plain image, based on a card game trick. Integer values of the hexadecimal key SHA-512 are also used, along with the adaptive block-based modular addition of pixels to encrypt the images. To prove the first-rate encryption performance of our proposed algorithm, security analyses are provided in this paper. Simulations and other results confirmed the robustness of the proposed image encryption algorithm against many well-known attacks; in particular, brute-force attacks, known/chosen plain text attacks, occlusion attacks, differential attacks, and gray value difference attacks, among others.

show abstract

“…In this type of attack, an adversary attempts to guess the correct security key by exhaustively scanning the key space of an encryption algorithm. Therefore, to protect the algorithm from an assault using brute force, having a key space that is sufficiently large is one of the primary criteria that can guarantee higher safety [36]. In an image encryption algorithm, the key space is the collection of all of the employed secret keys that can be utilized to decrypt images.…”

Section: Key Spacementioning

confidence: 99%