Journal Article10.1007/S42514-020-00043-8
Quantum image encryption algorithm based on generalized Arnold transform and Logistic map
WenWen Hu,Ri-Gui Zhou,She-Xiang Jiang,She-Xiang Jiang,XingAo Liu,Jia Luo +5 more
- 01 Sep 2020
- Vol. 2, Iss: 3, pp 228-253
21
TL;DR: Experimental results and numerical analysis indicate that the presented quantum algorithm has good visual effects and high security and compared to classical image processing algorithm, the investigated quantum encryption algorithm demonstrates an exponential speedup with computational cost of 2 n for quantum grayscale or color images.
read more
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 $${\rm O}\left( n \right)$$
for a $$2^{n} \times 2^{n}$$
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Secret Sharing-based Personal Health Records Management for the Internet of Health Things
Parsa Sarosh,Shabir A. Parah,G. Mohiuddin Bhat,Ali Asghar Heidari,Ali Asghar Heidari,Khan Muhammad +5 more
TL;DR: This paper evaluates a distributed security module for the clinical images that form 80% of the health data and reveals the strength of the cryptosystem and gives an insight into the degree of security provided to the health-related data.
43
Quantum image encryption scheme based on 2D $$\varvec{Sine^{2}-Logistic}$$ S i n e 2
TL;DR: A qubit-level selective scrambling and overlapping feedback diffusion method based on a new 2D cross Sine-2-Logistic chaotic map that combines Sine and Logistic chaotic systems is proposed and shown to be highly secure and reliable.
34
Quantum-enhanced Chaotic Image Encryption: Strengthening Digital Data Security With 1-D Sine-based Chaotic Maps and Quantum Coding
Mujeeb ur Rehman
TL;DR: This research proposes a quantum-enhanced chaotic image encryption scheme using 1-D sine-based chaotic maps and quantum coding, introducing a novel encryption method that leverages quantum uncertainty and advanced operators to create highly robust and secure encrypted images.
14
Fast and Robust Image Encryption Scheme Based on Quantum Logistic Map and Hyperchaotic System
TL;DR: Simulation results and theoretical analysis verify that the presented scheme has high safety performance, a good encryption effect, and a large key space, and the method can effectively resist exhaustive, statistical, and differential attacks.
Quantum Image Encryption Using a Self-Adaptive Hash Function-Controlled Chaotic Map (SAHF-CCM)
TL;DR: The aim of this paper is to introduce a self-adaptive encryption scheme to protect quantum image efficiently with minimal storage requirements and the experimental results proved that the scheme is robust, secure and efficient.
References
•Book
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Jan 2000
TL;DR: In this article, the quantum Fourier transform and its application in quantum information theory is discussed, and distance measures for quantum information are defined. And quantum error-correction and entropy and information are discussed.
Quantum computation and quantum information
TL;DR: This book inchides well-known classics such as "On the Criteria to be used in Decomposing Systems into Modules," "On a 'Buzzword': Hierarchical Structure," and "Software Aging."
20.4K
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Dec 2010
TL;DR: This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
19.6K
Simulating physics with computers
TL;DR: In this paper, the authors describe the possibility of simulating physics in the classical approximation, a thing which is usually described by local differential equations, and the possibility that there is to be an exact simulation, that the computer will do exactly the same as nature.
Elementary gates for quantum computation.
Adriano Barenco,Charles H. Bennett,Richard Cleve,David P. DiVincenzo,Norman Margolus,Peter W. Shor,Tycho Sleator,John A. Smolin,Harald Weinfurter +8 more
TL;DR: U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
4.7K