No abstract

Image encryption is an efficient and vital way to protect classified and secret images. With the advancement of the processing power of the computer, AES, DES, or chaotic series type just alike image encryption schemes are not as secure as before. Therefore, in this paper, we present a new hybrid image encryption method for protecting secret and imperative images by employing logistic sine system (LSS) together with two-dimensional cellular automata and FSM-based DNA rule generator. The secure hash (SHA-256) algorithm is used to generate a secret key and to compute initial values for the LSS. In our proposed method, there are three stages and each stage has its own rule. After the scrambling process, the first stage is the Feistel structure-based bit inversion (FSBI) to change the pixels' value. The second stage is 2D-CA with Moore neighborhood structure-based local rules. The third is DNA conversion based on finite-state machine (FSM-DNA) rule generator. The proposed encryption scheme is robust against the well-known attacks, such as statistical attacks, brute force attacks, differential attacks, and pixel correlation attacks, and also possesses strong key sensitivity. The results show that our three-layer hybrid image encryption technique is robust against many well-known attacks and can be applied directly to all types of classified gray-scale images to make them more secure from such cryptography attacks.

Several secure image encryption systems have been researched and formed by chaotic mechanisms in current decades. This work recommends an innovative quantum color image encryption method focused on the Lucas series-based substitution box to enhance the competence of encryption. The suggested encryption technique has more excellent key space and significant confidentiality. The chaotic system, along with the substitution box, exhibits additional complicated dynamical behavior, sufficient arbitrariness, and uncertainty than all others focused on just chaotic models. Theoretical and simulation assessments show that the offered image encryption performs admirably, its traditional equivalents in terms by efficiency in terms of statistical analysis.

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.

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.