On a Symmetric Image Encryption Algorithm Based on the Peculiarity of Plaintext DNA Coding

Abstract

Many plaintext-related or non-plaintext-related image encryption algorithms based on chaotic systems have been found inefficient and insecure under chosen plaintext attacks. In this paper, a novel plaintext-related mechanism based on the peculiarity of plaintext DNA coding (PPDC) is presented and used to developed a symmetric image encryption algorithm. In our scheme, a hyper-chaotic Lorenz system is used to produce four chaotic sequences. Firstly, by using one chaotic sequence to control the DNA rules, the original image is encoded to obtain the image DNA coding and PPDC, and another chaotic sequence is encoded into a DNA sequence, which is used in the DNA XOR operation. Then, the processing of the remaining two chaotic sequences by using the PPDC is performed to obtain two key streams, which are used in the permutation stage. After performing the traditional permutation operation and DNA XOR operation, the cipher image is obtained. Because of the use of the PPDC, the key streams used in the permutation stage are related to the secret keys and plaintext image, which gives the encryption system higher plaintext sensitivity and security. The simulation experimental results and security analysis demonstrate that the proposed encryption system possesses high efficiency and security and can resist various typical attacks like exhaustive attack, statistical attack, and differential attack effectively.

A Novel and Fast Encryption System Based on Improved Josephus Scrambling and Chaotic Mapping

“…• Some encryption schemes are insensitive to subtle differences of the original image and insufficient to resist chosen-plaintext attacks (CPAs). Table 1 shows the papers that have been cracked in recent years; • Low robustness of noise-resistings and occlusion-resistings because of the high sensitivity of ciphertext [7,16,18,38]…”

“…According to the characteristics of the scrambling method, the above algorithms can be divided into two categories: one is that the size of the original image remains unchanged [1,[4][5][6][7][8][9][10][11][12][13][14]19,23,28,29], and the other is that the plaintext image is decomposed into another size for scrambling [15][16][17][18][20][21][22][24][25][26][27].…”

“…To improve the plaintext sensitivity of a cryptosystem, in [6], the plaintext information is employed to generate the parameters of the extended Arnold map and influence the diffusion operation. Kang et al [7] presented a novel plaintext-related mechanism, in which the numbers of A, T, C, and G of plaintext DNA coding are used to control the permutation process. In addition, SHA algorithms have been applied in cryptographic frameworks to pursue high plaintext sensitivity [8,11,12,14,23].…”

“…For instance, in [8], the hash values of the plaintext image calculated by the SHA256 algorithm are used as the initial values of the non-coupled map lattice function. However, these schemes suffer from some drawbacks, such as the weak scrambling effect [6,9], a long permutation time [7], or a low application value because of its one-time-pad-like property [8,11,12,14,23]. For the characteristic of easy implementation, permutations based on index matrices which are derived from sorting and matching random sequences has been used in many encryption schemes [4,5,28,29].…”

SIEA: Secure Image Encryption Algorithm Based on Chaotic Systems Optimization Algorithms and PUFs

“…As new attacks are developed, new cryptographic algorithms and countermeasures should be constantly investigated [7]. One of the outstanding topics among these researches involves design studies based on nonlinear dynamics [8][9][10][11][12]. The number of studies on this subject in recent years is in the thousands [13].…”