Abstract Data encryption is one of the main factors in their transmission. In this paper, we have described an algorithm for color image encryption, some quantum encryption and image scrambling operations will be performed based on bitplane representation of quantum images (BRQI). Next, the image created using the logistic map (key image) is blended with the output of the first step, which was possible with the help of a quantum comparator circuit. Finally we create a secure image as the output of the encryption algorithm. Experiments with simulation and analysis of parameters such as entropy and correlation coefficient of adjacent pixels in three main positions show that the proposed algorithm has been very efficient and effective in securing and encrypting color images.
Abstract Data encryption is one of the main factors in their transmission. In this paper, we have described an algorithm for color image encryption, some quantum encryption and image scrambling operations will be performed based on bitplane representation of quantum images (BRQI). Next, the image created using the logistic map (key image) is blended with the output of the first step, which was possible with the help of a quantum comparator circuit. Finally we create a secure image as the output of the encryption algorithm. Experiments with simulation and analysis of parameters such as entropy and correlation coefficient of adjacent pixels in three main positions show that the proposed algorithm has been very efficient and effective in securing and encrypting color images.
Abstract The parallel computing power of quantum computing and the special properties of qubits provide an effective solution for image processing tasks. This paper presents a quantum image encryption algorithm based on Fisher-Yates algorithm and Logistic mapping. Firstly, the Fisher-Yates algorithm is used to generate three key sequences, one of which is used to encode the coordinate qubits of the image. Using the other two keys and the preset rules, the quantum coordinate scrambling operation is designed based on the encoded coordinate qubit, which effectively scrambles the spatial information of the plaintext image. Next, another set of key sequences is generated, one of which is used to encode the color qubits of the image. Using two other key sequences and different rules, a qubit plane scrambling operation based on coded color qubits is designed, and the color information of image is scrambled successfully. Finally, the quantum key image is generated based on Logistic mapping, and the key image is scrambled based on Fisher-Yates algorithm to improve the key complexity. The final ciphertext image is obtained by performing XOR operation between the original image and the scrambled key image. The complete quantum circuit diagram of the scheme is given in this paper. The experimental results and security analysis prove the effectiveness of the scheme, which provides a large key space and the computational complexity is only O(n).
In this paper, a quantum image encryption scheme is proposed by using the inter–intra bit-level permutation strategy. The image to be encrypted is first represented by a novel enhanced quantum representation model, and then, the intra and inter permutation operations are successively performed on bit planes. The intra bit permutation is achieved by sorting chaotic sequence, and the inter bit permutation is accomplished with qubit XOR operations between the two selected bit planes. The ciphertext image is finally obtained through a chaotic diffusion procedure implemented with a quantum image XOR operation. The XOR operation is realized by controlled- NOT gates, which is controlled by a chaotic sequence generated with a logistic map. The parameters of the logistic map are sensitive, which makes the key space large enough to resist brute-force attack. The proposed scheme not only modifies the pixel positions and gray values but also makes the bit distribution more uniform. The quantum circuits for the proposed encryption algorithm are devised. The simulation results and theoretical analysis show that the proposed method is more efficient than its classical counterpart, and its security is verified by the statistical analysis, keys sensitivity, and key space analysis.
A quantum color image encryption algorithm based on geometric transformation and intensity channel diffusion was designed. Firstly, a plaintext image was transformed into a quantum state form using the quantum image representation based on HSI color space (QIRHSI) representation as a carrier. Next, a pseudo-random sequence was generated using the generalized logistic map, and the pixel positions permuted multiple two-point swap operations. Immediately afterward, the intensity values were changed by an intensity bit-plane cross-swap and XOR, XNOR operations. Finally, the intensity channel of the above image was diffused in combination with the pseudo-confusion sequence as produced by the quantum logistic map to perform a diffusion operation on the intensity bit-plane to obtain the ciphertext image. Numerical simulations and analyses show that the designed algorithm is implementable and robust, especially in terms of outstanding performance and less computational complexity than classical algorithms in terms of security perspective.
Quantum image representation plays an important role in quantum image processing. In this paper, a bitplane representation of quantum images (BRQI) is proposed, which uses (n+4) or (n+6) qubits to store a grayscale or RGB color image of 2npixels. Compared with a novel enhanced quantum representation (NEQR), and a novel quantum representation of color digital images (NCQI), the storage capacity of BRQI improves 16 times and 218times, respectively. Next, some quantum operations based on BRQI are proposed, these operations including complement of colors, reverse of bitplanes, and translation of bitplanes. Analyzed the implementation circuits of these operations, the result indicates that these operations based on BRQI have lower quantum cost than NEQR and NCQI. Furthermore, an image scrambling algorithm based on BRQI is presented by combining the above operations. Simulation experiments and performance analysis show that proposed scrambling algorithm is effective and efficient.
This paper presents a new quantum image encryption (QIE) algorithm that integrates a newly developed 4D Quantum Logistic-Jerk Hyperchaotic System (4D-QLJHS) with a quantum image representation (QIR) model, enabling secure and efficient image transmission.By reducing qubit usage and circuit depth, the proposed QIE framework significantly improves quantum resource efficiency.Additionally, incorporating the enhanced 4D-LJHS map strengthened security and resistance against both quantum and classical attacks, surpassing the robustness and scalability of current quantum image encryption techniques.The new 4D-QLJHS is created by combining a logistic map and a jerk system, and then converted to a quantum hyperchaotic system using a Hamiltonianbased method.These systems help create a Quantum Pseudo-Random Number Generator (QPRNG) that generates random bit sequences used to alter and rearrange data at the quantum bit-plane level during the encryption process.The quantum encryption method uses the Quantum Image Representation based on Bit Planes (QIRBP) model, which enables modifying individual pixels and color channels via CNOT and SWAP gates.We evaluate various statistical tests to confirm the security and efficiency of our system.The experiments demonstrate that the system is highly secure, featuring adequate randomness, robust protection against specific attacks, and uniform distribution in the encrypted image data.Experimental simulations of some images indicate that the system provides a satisfactory level of security for image encryption, given the computational costs.This makes it suitable for real-time image communication where security is a priority.
In order to improve the security of traditional encryption systems, hyper-chaotic systems are introduced into the field of quantum image encryption. Firstly, the image is bitwise XOR by He fractional order hyper-chaotic Rabinovich system, and then the color image is represented as a quantum superposition state. The quantum image is scrambled by the unitary matrix generated by Logistic hyper-chaotic sequence, and then a hyper-chaotic sequence is generated to randomly replace the red, green and blue primary colors of each pixel to achieve the purpose of quantum image encryption. Finally, numerical simulation experiments are carried out on a computer. The experimental results show that the histogram of the encrypted image is flatter and even, the pixels are evenly distributed between 0 and 255, the correlation between adjacent pixels of the image is low. The average correlation coefficients of the red, green, and blue pixels of the encrypted image are 0.0012, 0.0025, and 0.0018. The system has high key sensitivity and can effectively resist statistical analysis attacks. The algorithm has good security and robustness.