Chaotic color image encryption based on 4D chaotic maps and DNA sequence

Wang, Simiao; Peng, Qiqi; Du, Baoxiang

doi:10.1016/j.optlastec.2021.107753

Cited by 118 publications

(35 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…During transmission or reception, it is possible that the information may be affected by noises and can be tempered over the insecure channel. A cryptosystem should be capable to resist the attacks and recover the data up to certain level even after tempering in data [53]- [54]. To validate the robustness of the algorithm, we estimated the MSE and PSNR by introducing Gaussian noise and occlusion to transmitted content.…”

Section: Noise and Occlusion Attack Analysismentioning

confidence: 99%

Discrete Logarithmic Factorial Problem and Einstein Crystal Model Based Public-Key Cryptosystem for Digital Content Confidentiality

et al. 2022

View full text Add to dashboard Cite

Public-key encryption is extensively used to provide digital data confidentiality and deliver the security features, such as nonrepudiation (digital signature) and secure key exchange. Conventional publickey schemes are based on mathematical problems with inflexible constraints, and the security of digital contents relies on computational complexity. In the era of emerging technologies, most public-key image encryption schemes are susceptible to various threats. We propose a novel public-key encryption in this article with near-ring criteria and provide confidentiality to private data with the microstates of the Einstein crystal model. The virtual oscillator generated by microstates of initial oscillators for the common secrets with the public-key scheme produces unique states to encrypt digital data. The privacy-preserved structure, that mimics the data stream of digital content with the behavior of the improved Einstein crystal model, describes a system in terms of microstates to generate diffusion in the plain data with unique states of a virtual oscillator. The performance and digital forensic evaluations, such as randomness, histogram uniformity, pixels' correlation, pixels' similarity, visual strength, pixels' incongruity, key sensitivity, linear and differential attacks, noise, and occlusion attacks analyses, certify the resistivity of the proposed algorithm against potential threats and provide superior capacity in comparison to existing methodologies to hostile certain attacks.

show abstract

Section: Noise and Occlusion Attack Analysismentioning

confidence: 99%

Discrete Logarithmic Factorial Problem and Einstein Crystal Model Based Public-Key Cryptosystem for Digital Content Confidentiality

et al. 2022

View full text Add to dashboard Cite

show abstract

“…Hyperchaotic behavior is a more complex dynamical behavior compared with chaotic behavior. High-dimensional chaos has the characteristics of complex dynamic behavior and complex structure [35][36][37][38]. For example, Liu et al proposed a new 3D chaotic system and generated an S-box for the encryption algorithm based on this chaotic system [36].…”

Section: Introductionmentioning

confidence: 99%

A Novel 2D Hyperchaotic with a Complex Dynamic Behavior for Color Image Encryption

Hu¹,

Nan²

2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

The generation method of the key stream and the structure of the algorithm determine the security of the cryptosystem. The classical chaotic map has simple dynamic behavior and few control parameters, so it is not suitable for modern cryptography. In this paper, we design a new 2D hyperchaotic system called 2D simple structure and complex dynamic behavior map (2D-SSCDB). The 2D-SSCDB has a simple structure but has complex dynamic behavior. The Lyapunov exponent verifies that the 2D-SSCDB has hyperchaotic behavior, and the parameter space in the hyperchaotic state is extensive and continuous. Trajectory analysis and some randomness tests verify that the 2D-SSCDB can generate random sequences with good performance. Next, to verify the excellent performance of the 2D-SSCDB, we use the 2D-SSCDB to generate a keystream for color image encryption. In the encryption algorithm, the encryption algorithm scrambles and diffuses simultaneously, increasing the cryptographic system's security. The horizontal correlation, vertical correlation, and diagonal correlation of ciphertext are −0.0004, −0.0004 and 0.0007, respectively. The average information entropy of the ciphertext is 7.9993. In addition, the designed encryption algorithm reduces the correlation between the three channels of the color image. Security analysis shows that the color image encryption algorithm designed using 2D-SSCDB has good security, can resist standard attack methods, and has high efficiency.

show abstract

“…Some encryption schemes combined various mathematical theories of interesting problems [ 13 , 14 ]; for example, Josephus Problem was employed in [ 13 ] for designing a secure and efficient image encryption scheme. Some encryption schemes combine DNA coding technologies to acquire the confusion effect similarly to S-box [ 15 , 16 , 17 ]. Most schemes encrypt the image as a whole, but a few methods divide the image into several small blocks for encryption; e.g., Zhang et al.…”

Section: Introductionmentioning

confidence: 99%

Cryptanalysis of an Image Encryption Algorithm Based on a 2D Hyperchaotic Map

Zhang

Chen

2022

Entropy

View full text Add to dashboard Cite

Recently, an image encryption scheme based on a 2D hyperchaotic map is proposed. It adopts the permutation–diffusion architecture and consists of three steps, which are permutation, forward diffusion, and backward diffusion. In this paper, we break this cipher with both the chosen-plaintext attack (CPA) and the chosen-ciphertext attack (CCA). According to our analysis, we found the two complex diffusion processes could be simplified into two simple diffusions and a modular addition operation. Based on this, the equivalent key can be obtained with CPA and CCA. Detailed theoretical derivations and the results of experiments confirmed the feasibility of our attack methods. When the image size was 256×256, the running time of the attacks was less than 2 hours on a laptop with a 2.59 GHz Intel Core i7 and 16 GB DDR3 memory. Other sizes of images were also tested, and some rules were found. In addition, the probability of other attacks has also been discussed, and some suggestions for improvements are given. The source codes are publicly available and can be found online.

show abstract

Chaotic color image encryption based on 4D chaotic maps and DNA sequence

Cited by 118 publications

References 33 publications

Discrete Logarithmic Factorial Problem and Einstein Crystal Model Based Public-Key Cryptosystem for Digital Content Confidentiality

Discrete Logarithmic Factorial Problem and Einstein Crystal Model Based Public-Key Cryptosystem for Digital Content Confidentiality

A Novel 2D Hyperchaotic with a Complex Dynamic Behavior for Color Image Encryption

Cryptanalysis of an Image Encryption Algorithm Based on a 2D Hyperchaotic Map

Contact Info

Product

Resources

About