The image security problem is an important area in information security, and image encryption plays a vital role in this day. To protect the image encryption from the attack of quantum algorithm appeared recently, an image encryption method based on quantum Fourier transformation is proposed here. First, the image encryption and Fourier transformation are discussed here, then a encryption function is proposed. Second, a quantum Fourier transformation is introduced to quantum encryption, and the full step of quantum encryption is given as well. Third, the security of the proposed quantum encryption if analyzed, and some propositions are also presented. Lastly, some conclusions are indicated and some possible directions are also listed.
The image security problem is an important area in information security, and image encryption plays a vital role in this day. To protect the image encryption from the attack of quantum algorithm appeared recently, an image encryption method based on quantum Fourier transformation is proposed here. First, the image encryption and Fourier transformation are discussed here, then a encryption function is proposed. Second, a quantum Fourier transformation is introduced to quantum encryption, and the full step of quantum encryption is given as well. Third, the security of the proposed quantum encryption if analyzed, and some propositions are also presented. Lastly, some conclusions are indicated and some possible directions are also listed.
In the digital era, the security of image data has become increasingly important. This study aims to develop an image encryption scheme based on Quantum Key Distribution (QKD) and Fractional Fourier Transform (FRFT) to enhance the security of image data transmission and storage. The proposed scheme first utilizes QKD to generate and distribute secure encryption keys, ensuring the unconditional security of the key distribution process. Subsequently, FRFT is employed to perform complex transformations on the image data, using fractional order parameters to achieve multi-scale representation of the image in both time and frequency domains, thereby increasing the complexity and security of the encryption process. Experimental results demonstrate that this scheme exhibits significant advantages in terms of the quality of encrypted images and their resistance to attacks. Specifically, the encrypted images possess high Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index (SSIM), effectively resisting various attacks. Comparative analysis further verifies the superiority of this scheme in terms of security and efficiency. In summary, the proposed combination of QKD and FRFT for image encryption holds great potential and research value in the protection of image data.
Since their introduction, numerous quantum image encryption methods have been developed. As we shall demonstrate, protecting visual information against classical and quantum threats depends on representations. In this paper, we identify the essential components of quantum encryption algorithms and explain a variety of quantum image representations with different levels of qubit efficiency, computational complexity, and security. The paper also explores the favourable and unfavourable aspects of hybrid, chaos-based, quantum transform-based, and DNA-based quantum image encryption schemes. The security analysis focuses on noise tolerance and scalability. This involves aspects such as key space size, resistance to various attacks, and calculation efficiency. Meanwhile, potential areas for investigation include robust algorithms, hybrid systems and reducing decoding errors. We also address the implementation difficulties involved, including the necessary hardware and decoding error reduction. Classical and quantum techniques, as well as more advanced quantum equipment, are considered too. The evaluation calls for uniform policies and realistic responses and emphasises how quantum image encryption could transform information security in the quantum era. and realistic answers and highlights how quantum image encryption may change information safety within the quantum generation.
Since their introduction, numerous quantum image encryption methods have been developed. As we shall demonstrate, protecting visual information against classical and quantum threats depends on representations. In this paper, we identify the essential components of quantum encryption algorithms and explain a variety of quantum image representations with different levels of qubit efficiency, computational complexity, and security. The paper also explores the favourable and unfavourable aspects of hybrid, chaos-based, quantum transform-based, and DNA-based quantum image encryption schemes. The security analysis focuses on noise tolerance and scalability. This involves aspects such as key space size, resistance to various attacks, and calculation efficiency. Meanwhile, potential areas for investigation include robust algorithms, hybrid systems and reducing decoding errors. We also address the implementation difficulties involved, including the necessary hardware and decoding error reduction. Classical and quantum techniques, as well as more advanced quantum equipment, are considered too. The evaluation calls for uniform policies and realistic responses and emphasises how quantum image encryption could transform information security in the quantum era. and realistic answers and highlights how quantum image encryption may change information safety within the quantum generation.
The quantum image encryption and authentication algorithm are proposed based on quantum affine transformation and quantum Haar wavelet transform. This algorithm is divided into two main steps: encryption and embedding. During the encryption phase, affine transform and Hénon map are combined to carry out scrambling-diffusion processing on the plaintext image. In the phase of embedding, the color carrier image undergoes decomposition using the quantum Haar wavelet transform. Then the ciphertext image information and identity information are hidden into the wavelet domain of the color carrier image, and the final transmitted image has visual significance. The suggested algorithm significantly minimizes the risk of image data compromise during transmission and realizes the dual security of encryption and authentication. The security and the robustness of the algorithm are analyzed by using the evaluation indexes of image encryption and information hiding. The findings indicate that the introduced algorithm offers superior security compared to alternative methods, ensuring a more dependable and safeguarded transmission of image data.
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.
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.