Images are important data carriers because, compared to text data, they are harder to transfer or store securely and include higher volumes and redundancies of digital data. Images can be shielded against a variety of risks with security, including eavesdropping and illegal copying and alteration. Because of the potential quantum risk to the existing cryptographic encryption methods and the quick advancement towards the development of quantum computers, quantum image encryption algorithms have recently drawn increasing amounts of attention. The majority of quantum image encryption techniques such as diffusion and scrambling, involve two separate rounds. In this model, the three different chaotic maps are used separately for scrambling the images to determine the performance of the quantum image cryptography with different combination of the model. At first, the hash256 algorithm is used for generating the quantum key and the forward diffusion takes place for diffusing the first pixel to final pixel of the input image information. Then, the three different chaotic maps such as pixel permutation, Chen attractor and Lorenz attractor are used for scrambling the input image. Finally, the bit-level permutation and backward diffusion process are considered for the scrambled image. For evaluating the performance of the quantum image cryptography based on the three different chaotic maps, the NPCR, UACI, Entropy, SSIM, correlation characteristics and histogram analysis are determined. The attained NPCR, UACI, Entropy and SSIM of the CASIA2 dataset for Lorenz attractor are improved than the pixel permutation and Chen attractor. Thus, from the attained values, the Quantum Image Cryptography Based on Continuous Chaotic Map such as Lorenz attractor performs better for the statistical and differential analysis than the other chaotic maps.
Images are important data carriers because, compared to text data, they are harder to transfer or store securely and include higher volumes and redundancies of digital data. Images can be shielded against a variety of risks with security, including eavesdropping and illegal copying and alteration. Because of the potential quantum risk to the existing cryptographic encryption methods and the quick advancement towards the development of quantum computers, quantum image encryption algorithms have recently drawn increasing amounts of attention. The majority of quantum image encryption techniques such as diffusion and scrambling, involve two separate rounds. In this model, the three different chaotic maps are used separately for scrambling the images to determine the performance of the quantum image cryptography with different combination of the model. At first, the hash256 algorithm is used for generating the quantum key and the forward diffusion takes place for diffusing the first pixel to final pixel of the input image information. Then, the three different chaotic maps such as pixel permutation, Chen attractor and Lorenz attractor are used for scrambling the input image. Finally, the bit-level permutation and backward diffusion process are considered for the scrambled image. For evaluating the performance of the quantum image cryptography based on the three different chaotic maps, the NPCR, UACI, Entropy, SSIM, correlation characteristics and histogram analysis are determined. The attained NPCR, UACI, Entropy and SSIM of the CASIA2 dataset for Lorenz attractor are improved than the pixel permutation and Chen attractor. Thus, from the attained values, the Quantum Image Cryptography Based on Continuous Chaotic Map such as Lorenz attractor performs better for the statistical and differential analysis than the other chaotic maps.
Given the limitations of current classic image encryption algorithms and the unconditional security characteristics of quantum key distribution protocols, the author proposes an image encryption method based on quantum key distribution and pixel scrambling. The author first analyzed the security issues of quantum image encryption algorithms based on image scrambling methods, namely that image scrambling methods have periodicity, which can ensure that the image can be restored after scrambling. If an image cannot be guaranteed to return to its original state after performing scrambling operations, legitimate users cannot obtain the secret information in the original image, and image scrambling loses its original meaning; However, the periodicity of image scrambling methods not only ensures that legitimate users can decrypt images, but also provides convenience for attackers to steal original image information. Secondly, it is pointed out that when evaluating and analyzing quantum image encryption algorithms, the evaluation indicators should include two parts: One is performance analysis, which is the analysis of the network complexity of quantum circuits. In quantum computing, the network complexity of quantum circuits is usually represented by the number of quantum basic logic gates. The second is security analysis, which mainly includes key analysis (including key space size and key sensitivity analysis), statistical analysis (including pixel correlation, histogram analysis, information fusion, and scatter plot distribution density analysis). Finally, experimental simulations have shown that the NPCR values of the plaintext and ciphertext images of the three images tend to 100%. The encrypted image histogram is evenly distributed, with very weak pixel correlation and high pixel change rate and information entropy.
Encryption is a vital tool for safeguarding photos from unauthorized access. The ease of storing data in the cloud has come with a downside: increased vulnerability to hacking. Securing communication is paramount in today's digital world, and encryption is essential for achieving this. Many photo encryption techniques hinge on chaotic logistic maps. Basically, two aspects of chaotic maps Continuous chaotic map and discrete chaotic map. This proposal defines utilization of Quantum cryptography-based Image encryption technique by using pixel permutation. The standard algorithms and procedures used by classical cryptography, such as key exchange methods for secrecy and public-key encryption techniques for digital signatures, are delivered on a regular basis to fulfill these obligations. They are simple to manipulate using cutting-edge technology, but they have some drawbacks when it comes to real-time communication security assurance phases. The reliability of classical cryptography is limited to Scheming. In classical cryptography, the key size is in a somewhat reduced form. Therefore, it is unknown how long the algorithm will last. Hackers can use it to take screenshots of the encrypted data, which they can subsequently use to carry out other immoral tasks. Numerous cryptographic tasks may be accomplished with quantum cryptography. Since encrypted data cannot be copied or read in the quantum state, unethical communication practices are reduced. Passive attacks are unfeasible due to the huge key space that quantum communication may exploit. To enhance the security level, we used pixel permutation model in discreate chaotic map Gingerbreadman map.
In order to increase the security and robustness of quantum images, this study combined the quantum DNA codec with quantum Hilbert scrambling to offer an enhanced quantum image encryption technique. Initially, to accomplish pixel-level diffusion and create enough key space for the picture, a quantum DNA codec was created to encode and decode the pixel color information of the quantum image using its special biological properties. Second, we used quantum Hilbert scrambling to muddle the image position data in order to double the encryption effect. In order to enhance the encryption effect, the altered picture was then employed as a key matrix in a quantum XOR operation with the original image. The inverse transformation of the encryption procedure may be used to decrypt the picture since all the quantum operations employed in this research are reversible. The two-dimensional optical image encryption technique presented in this study may significantly strengthen the anti-attack of quantum picture, according to experimental simulation and result analysis. The correlation chart demonstrates that the average information entropy of the RGB three channels is more than 7.999, the average NPCR and UACI are respectively 99.61% and 33.42%, and the peak value of the ciphertext picture histogram is uniform. It offers more security and robustness than earlier algorithms and can withstand statistical analysis and differential assaults.
Background: Quantum image processing is rapidly developing in the field of quantum computing, and it can be successfully implemented on the Noisy Intermediate-Scale Quantum (NISQ) device. Quantum image encryption holds a pivotal position in this domain. However, the encryption process often encounters security vulnerabilities and entails complex computational complexities, thereby consuming substantial quantum resources. To address this, the present study proposes a quantum image encryption algorithm based on four-dimensional chaos. Methods: The classical image is first encoded into quantum information using the Generalized Quantum Image Representation (GQIR) method. Subsequently, the trajectory of the four-dimensional chaotic system is randomized, and multi-dimensional chaotic keys are generated to initially encrypt the pixel values of the image. Then, the Arnold transformation is applied to randomly encrypt the pixel positions, resulting in the encrypted image. During the decryption process, the inverse process of encryption is employed to restore the original image. Results: We simulated this process in the Python environment, and the information entropy analysis experiment showed that the information entropy of the three encrypted images reached above 7.999, so the system has good encryption. At the same time, the correlation of the pixel distribution after the encryption algorithm is weak, which proves that the control parameters of the chaotic system can effectively reduce the correlation between pixels in the image. In the final key space analysis, the key space issued by our encryption can reach $10 140 \gg 2 128 $. Conclusion: Our method is resistant to destructive attacks and can produce scrambled images with higher encryption and usability. This algorithm solves the problems of general encryption algorithms such as periodicity, small key space, and vulnerability to statistical analysis, and proposes a reliable and effective encryption scheme. By making full use of the characteristics of Arnold transformation permutation, ergodicity and the randomness of the four-dimensional chaotic system, the encryption algorithm uses the larger key space provided by the four-dimensional Lorenz system.
The rapid advancement in consumer technology has led to an exponential increase in the connected devices, resulting in an enormous and continuous flow of data, particularly the image data. This data needs to be processed, managed, and secured efficiently, especially in the quantum-enabled consumer technology era. This paper, in this regards, presents a quantum image encryption scheme featuring a novel two-phase chaotic confusion-diffusion architecture. The proposed architecture consists of four distinct confusion-diffusion modules that perform a simultaneous qubit and pixel-level encryption on both the position and intensity of quantum encoded pixels. Moreover, quantum circuits for′qubit-level chaotic transformation′and′chaos-based selective perfect shuffle operation′have been implemented, which collectively enhance the encryption strength of the proposed scheme. Extensive evaluation has been performed based on various statistical security parameters, such as entropy and correlation. When subjected to differential attacks, the proposed scheme proved its resilience exhibiting ideal results of average 99.6% NPCR (Number of Pixels Change Rate) and 33.5% UACI (Unified Average Changing Intensity). Besides, the proposed scheme also demonstrated resilience against occlusion attacks. Tests involving 50% data occlusion from encrypted images validated the proposed scheme’s capability to successfully decrypt the tampered images, recovering maximum information.
In encryption technology, image scrambling is a common processing operation. This paper proposes a quantum version of the 3D Mobius scrambling transform based on the QRCI model, which changes not only the position of pixels but also the gray values. The corresponding quantum circuits are devised. Furthermore, an encryption scheme combining the quantum 3D Mobius transform with the 3D hyper-chaotic Henon map is suggested to protect the security of image information. To facilitate subsequent processing, the RGB color image is first represented with QRCI. Then, to achieve the pixel-level permutation effect, the quantum 3D Mobius transform is applied to scramble bit-planes and pixel positions. Ultimately, to increase the diffusion effect, the scrambled image is XORed with a key image created by the 3D hyper-chaotic Henon map to produce the encrypted image. Numerical simulations and result analyses indicate that our designed encryption scheme is secure and reliable. It offers better performance in the aspect of key space, histogram variance, and correlation coefficient than some of the latest algorithms.