DNA and Plaintext Dependent Chaotic Visual Selective Image Encryption

Abstract

Visual selective image encryption can both improve the efficiency of the image encryption algorithm and reduce the frequency and severity of attacks against data. In this article, a new form of encryption is proposed based on keys derived from Deoxyribonucleic Acid (DNA) and plaintext image. The proposed scheme results in chaotic visual selective encryption of image data. In order to make and ensure that this new scheme is robust and secure against various kinds of attacks, the initial conditions of the chaotic maps utilized are generated from a random DNA sequence as well as plaintext image via an SHA-512 hash function. To increase the key space, three different single dimension chaotic maps are used. In the proposed scheme, these maps introduce diffusion in a plain image by selecting a block that have greater correlation and then it is bitwise XORed with the random matrix. The other two chaotic maps break the correlation among adjacent pixels via confusion (row and column shuffling). Once the ciphertext image has been divided into the respective units of Most Significant Bits (MSBs) and Least Significant Bit (LSBs), the host image is passed through lifting wavelet transformation, which replaces the low-frequency blocks of the host image (i.e., HL and HH) with the aforementioned MSBs and LSBs of ciphertext. This produces a final visual selective encrypted image and all security measures proves the robustness of the proposed scheme.

A Method to Determine the Most Suitable Initial Conditions of Chaotic Map in Statistical Randomness Applications

“…For example, it can be used instead of the s-box structures in Ref. [61], as well as in successful image encoding algorithms in the literature [62,63].…”

An Image Encryption Algorithm Based on Bisection Method and One-Dimensional Piecewise Chaotic Map

“…For a successful encryption scheme, the key space should be wide enough to withstand a brute force attack. It must [12] 99.607% 33.427 [11] 99.630% 33.400 [24] 90.955 % 30.433 [22] 99.655% 33.467 be more than or same to 2 100 . In the BPCM algorithm, the key space has three parts: the initial value and the parameter of the Tent chaotic map, the coefficients of continuous polynomial functions of variate degree n > 0, and the interval boundaries.…”

“…[23] used a 3D chaotic logistic map with DNA encoding to suggest an image encryption approach. A new form of encryption was proposed by [24] based on keys derived from DNA and plaintext image. In this paper, the proposed encryption algorithm is based on 1D chaotic Tent map to change pixel values of image because it is simple to implement than other high-dimensional chaotic maps and of course it ıs achieved by the general useful properties of chaotic maps.…”

Double-Image Visually Meaningful Encryption Algorithm Based on Compressed Sensing and Frft Embedding

“…In the absence of compression stage, the resolution of the meaningful cipher image is four times that of the plain image, which increases the unnecessary cost of storage and transmission. Later, many improved visually meaningful image encryption algorithms [30][31][32][33][34] have been proposed one after another. Such as Ref.…”

“…The existing embedding methods, such as LSB [31], SVD [19,33], IWT [29,30], RCT [50], DCT [53] and so on, cannot protect the hidden ciphertext.…”