Quantum image encryption algorithm based on generalized Arnold transform and Logistic map
- PDF / 10,824,879 Bytes
- 26 Pages / 595.276 x 790.866 pts Page_size
- 60 Downloads / 276 Views
REGULAR PAPER
Quantum image encryption algorithm based on generalized Arnold transform and Logistic map Wen‑Wen Hu1,2 · Ri‑Gui Zhou1,2 · SheXiang Jiang3,1,2 · XingAo Liu1,2 · Jia Luo1,2 Received: 30 December 2019 / Accepted: 16 July 2020 © China Computer Federation (CCF) 2020
Abstract In the era of big data, image security and real-time processing become more and more important and increasingly difficult to satisfy. To improve the security and processing efficiency of image encryption algorithm, an enhanced quantum scheme is proposed for generalized novel enhanced quantum image representation. The proposed quantum encryption scheme mainly consists of two-stage operation in order, i.e., twice scrambling based generalized Arnold transform and pixel encryption based on the quantum key image (which are generated and prepared based on Logistic map). In the first stage, generalized Arnold transform are employed to simultaneously disturb the coordinate information and pixel gray value of quantum plain image. Following that, the scrambled image is further encrypted into a quantum cipher image based on quantum key image, which is divided into three sub-processes in detail, i.e., CNOT operations, bit-plane scrambling and controlled perfect shuffle permutations are executed orderly. The quantum image decryption process can be easily implemented in a reverse way. The complete quantum circuit implementation for above two stages operation is constructed and analyzed in terms of quantum cost and time complexity. Compared to classical image processing algorithm, the investigated quantum encryption algorithm demonstrates an exponential speedup with computational cost of O(n) for a 2n × 2n quantum grayscale or color images. The proposed scheme is simulated and verified on a classical computer with MATLAB environments, i.e., not in a real quantum version that not considers the effects of quantum noise. Experimental results and numerical analysis indicate that the presented quantum algorithm has good visual effects and high security. Keywords Quantum computers · Image encryption/decryption · Generalized arnold transform · Logistic map · Computational complexity This work is supported by the National Key R&D Plan under Grant No. 2018YFC1200200 and 2018YFC1200205.
1 Introduction
* Ri‑Gui Zhou [email protected]
Feynman R.P. first proposed the concept of simulating physics with computers, i.e., quantum computers (Feynman 1982). The information is stored in quantum systems and regarded as quantum bits (qubits) (Stajic 2013). Due to the inherent properties of quantum mechanics such as coherence, entanglement, and superposition of qubits, quantum information processing (QIP) is deemed to precede its classical counterparts in aspects of information storage, parallel computing and security (Michael and Isaac 2000). Although a real physical quantum computer has not been realized yet, it seems very necessary to develop quantum image processing tasks on account of that a quantum computer will inevitably need images displaying and proces
Data Loading...
