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.
read more
Abstract: Recently, quantum image encryption algorithms are attracting more and more attention, due to the upcoming quantum threat problem to the current cryptographic encryption algorithms with the rapid progress toward the quantum computer production. The aim of this paper is to introduce a self-adaptive encryption scheme to protect quantum image efficiently with minimal storage requirements. The methodology is to use two rounds of encryption with two different pseudorandom number sequences which are obtained from a new designed pseudorandom number generator (PRNG). This PRNG consists of two parts. The first part is based on iterating a recently proposed chaotic-based parallel keyed hash function which is used as a controller for a second part. The second part is a multiplication of Tent and Chebyshev chaotic maps (TCM). This combination of hash function and chaotic maps provides high randomness and a dramatical increase in the control parameters and initial values number which achieves extremely large key space and so makes the scheme stronger against brute force attacks. The seed or initial value of PRNG depends on the input image itself which makes the scheme self-adaptive and so it is stronger against chosen plaintext attacks and known-plaintext attacks. In the first round of encryption, the value of each pixel qubits of the input image is changed to a new value by XORing it with the corresponding qubits of the first pseudorandom sequence using CNOT and Toffoli quantum gates then shifting to the next qubit with the Swap quantum gate. In this round, the pixel value is changed. In the second round, diffusion of the changed pixel value is extended to each pixel in the input image using the second pseudorandom sequence and Toffoli quantum gates. The time complexity of the proposed scheme is less than many recently published quantum image encryption schemes. The scheme security analysis is discussed, and the experimental results proved that the scheme is robust, secure and efficient.
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
Quantum grayscale image encryption and secret sharing schemes based on Rubik’s Cube
Hua-Kun Wang,Guang-Bao Xu,Dong-Huan Jiang +2 more
- 01 Jan 2023
TL;DR: Wang et al. as discussed by the authors proposed a quantum image secret sharing scheme based on the Rubik's Cube rotation scrambling scheme (QRRSS) and quantum least significant bit (LSB) method.
17
Mixed Multi-Chaos Quantum Image Encryption Scheme Based on Quantum Cellular Automata (QCA)
Nehal A. Mohamed,Hala Abdel-Galil El-Sayed,Aliaa Youssif +2 more
TL;DR: A quantum image encryption scheme based on quantum cellular automata with mixed multi-chaos hybrid maps and a hyperchaotic system with quantum operations possesses excellent encryption efficiency, a high degree of security, and the ability to effectively withstand a variety of statistical attacks.
15
Advances and Vulnerabilities in Modern Cryptographic Techniques: A Comprehensive Survey on Cybersecurity in the Domain of Machine/Deep Learning and Quantum Techniques
Abid Mehmood,Arslan Shafique,Moatsum Alawida,Abdul Nasir Khan +3 more
TL;DR: The aim of the extensive survey and analysis of existing cryptographic techniques is to provide a deep understanding of innovative and diverse approaches within the cybersecurity domain, and to create a roadmap for the future to counter potential cyber threats and challenges.
14
Quantum image encryption algorithm based on four-dimensional chaos
Xiao-Dong Liu,Qian-Hua Chen,Run-Sheng Zhao,Guang-Zhe Liu,Shuai Guan,Liang-Long Wu,Xing-Kui Fan +6 more
TL;DR: Quantum image encryption algorithm based on four-dimensional chaos is a novel scheme that utilizes the chaotic dynamics of a four-dimensional system to encrypt images. The algorithm employs the GQIR method to encode classical images into quantum information, followed by chaotic key generation and pixel position randomization. The encrypted image exhibits high information entropy and low pixel correlation, ensuring robust security.
8
Quantum image encryption protocol for secure communication in healthcare networks
Sunil Prajapat,Ranjan Kumar,Pankaj Kumar +2 more
2
References
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
Quantum computation and quantum information
TL;DR: This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing, with a focus on entanglement.
15.9K
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor
- 20 Nov 1994
TL;DR: Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.
9.1K
A fast quantum mechanical algorithm for database search
Lov K. Grover
- 01 Jul 1996
TL;DR: In this paper, it was shown that a quantum mechanical computer can solve integer factorization problem in a finite power of O(log n) time, where n is the number of elements in a given integer.
8.1K
•Posted Content
A fast quantum mechanical algorithm for database search
TL;DR: In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
4.9K