Parrondo paradox in quantum image encryption
{\L}ukasz Pawela

TL;DR
This paper introduces a quantum image encryption method using discrete-time quantum walks and explores how the Parrondo paradox influences security, demonstrating robustness and high-quality encryption in quantum regimes.
Contribution
It presents a novel quantum image encryption protocol leveraging DTQWs and analyzes the role of the Parrondo paradox in enhancing security and diffusion.
Findings
Near-zero adjacent-pixel correlations after encryption
High ciphertext entropy close to 8-bit ideal
Strong sensitivity to plaintext changes with NPCR > 99%
Abstract
We present a quantum image encryption protocol that harnesses discrete-time quantum walks (DTQWs) on cycles and explicitly examines the role of the Parrondo paradox in security. Using the NEQR representation, a DTQW-generated probability mask is transformed into a quantum key image and applied via CNOT to encrypt grayscale images. We adopt an efficient circuit realization of DTQWs based on QFT-diagonalization and coin-conditioned phase layers, yielding low depth for \(N=2^n\) positions and \(t\) steps. On \(64\times 64\) benchmark images, the scheme suppresses adjacent-pixel correlations to near zero after encryption (e.g., \(|C_H|, |C_V|, |C_D| \approx 10^{-2}\)), produces nearly uniform histograms, and achieves high ciphertext entropy close to the 8-bit ideal. Differential analyses further indicate strong diffusion and confusion: NPCR exceeds \(99\%\) and UACI is around \(30\%\),…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
