Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call