Multi-Channel Quantum Image Scrambling

Image scrambling is a technique used for confidential storage and transmission as well as for image information hiding. In this study, we propose a multi-channel quantum image scrambling method, which applies both color and geometric transformations of an image. This is a simple and reliable method for transforming a meaningful quantum image into a meaningless or disordered one. We performed two simulation experiments, which demonstrated the efficiency and flexibility of the proposed method. Previous studies mainly developed scrambling strategies for grayscale quantum images, whereas the proposed method is effective for the color image scrambling in the quantum computing domain.

Download Full-text

A novel enhanced quantum image representation based on bit-planes for log-polar coordinates

Quantum Information and Computation ◽

10.26421/qic22.1-2-2 ◽

2022 ◽

Vol 22 (1&2) ◽

pp. 17-37

Author(s):

Xiao Chen ◽

Zhihao Liu ◽

Hanwu Chen ◽

Liang Wang

Keyword(s):

Color Image ◽

Image Representation ◽

Polar Coordinates ◽

Quantum Cost ◽

Color Information ◽

Simulation Experiments ◽

Quantum Image ◽

Comparison Results ◽

Bit Planes ◽

Quantum Image Representation

Quantum image representation has a significant impact in quantum image processing. In this paper, a bit-plane representation for log-polar quantum images (BRLQI) is proposed, which utilizes $(n+4)$ or $(n+6)$ qubits to store and process a grayscale or RGB color image of $2^n$ pixels. Compared to a quantum log-polar image (QUALPI), the storage capacity of BRLQI improves 16 times. Moreover, several quantum operations based on BRLQI are proposed, including color information complement operation, bit-planes reversing operation, bit-planes translation operation and conditional exchange operations between bit-planes. Combining the above operations, we designed an image scrambling circuit suitable for the BRLQI model. Furthermore, comparison results of the scrambling circuits indicate that those operations based on BRLQI have a lower quantum cost than QUALPI. In addition, simulation experiments illustrate that the proposed scrambling algorithm is effective and efficient.

Download Full-text

A Block-Based Quantum Image Scrambling for GNEQR

IEEE Access ◽

10.1109/access.2019.2942986 ◽

2019 ◽

Vol 7 ◽

pp. 138233-138243 ◽

Cited By ~ 3

Author(s):

Hai-Sheng Li ◽

Xiao Chen ◽

Shuxiang Song ◽

Zhixian Liao ◽

Jianying Fang

Keyword(s):

Image Scrambling ◽

Quantum Image ◽

Block Based ◽

Quantum Image Scrambling

Download Full-text

Chaos Based Image Encryption using Expand-Shrink Concept

International Journal of Informatics and Communication Technology (IJ-ICT) ◽

10.11591/ijict.v3i2.pp103-112 ◽

2014 ◽

Vol 3 (2) ◽

pp. 103 ◽

Cited By ~ 1

Author(s):

Naveenkumar S K ◽

Panduranga H T ◽

Kiran P

Keyword(s):

Information Security ◽

Image Encryption ◽

Color Image ◽

Communication Technologies ◽

Input Image ◽

Vital Role ◽

Image Scrambling ◽

Image Information ◽

Substitution Process ◽

Plain Image

Image information security plays a vital role in computing and communication technologies. This paper describes a new concept of expand and shrink to enhance the strength of chaos based image encryption technique. This method consists of both permutations as well as substitution process for image scrambling and encryption. In permutation plain image is shuffled using chaos technique. Input image undergo two times chaos permutation in-between expand and shrink process leads to substitution. Permutation decreases the correlation between the pixel and substitution increases the entropy of encrypted image. Proposed encryption technique works for both gray-scale and color image. From the experiment highly scrambled image is obtained at the end of encryption process. Decryption process employs exactly reverse process of encryption which results in the reconstructed images.

Download Full-text

Color Image Information Hiding Based on Perceptual Color Clustering

2010 International Conference on Computational Intelligence and Software Engineering ◽

10.1109/wicom.2010.5601277 ◽

2010 ◽

Cited By ~ 1

Author(s):

Li Jiang ◽

Zheng-quan Xu

Keyword(s):

Information Hiding ◽

Color Image ◽

Image Information ◽

Color Clustering

Download Full-text

Quantum image scrambling algorithm based on discrete Baker map

Modern Physics Letters A ◽

10.1142/s021773232050145x ◽

2020 ◽

Vol 35 (17) ◽

pp. 2050145 ◽

Cited By ~ 1

Author(s):

Chengan Hou ◽

Xingbin Liu ◽

Songyang Feng

Keyword(s):

Image Processing ◽

Image Encryption ◽

Circuit Complexity ◽

Quantum Image Processing ◽

Image Scrambling ◽

Initial Image ◽

Quantum Image ◽

Quantum Image Encryption ◽

Quantum Image Scrambling ◽

Baker Map

Quantum image processing has become a significant aspect within the field of quantum information processing because the image is an essential carrier of information, and quantum computation has powerful image processing ability. Image scrambling algorithms are often required as initial image operations in quantum image processing applications such as quantum image encryption and watermarking. However, the efficiency of existing quantum image scrambling algorithms needs to be improved urgently, especially in terms of periodicity. Therefore, a novel quantum image scrambling algorithm based on discrete Baker map is proposed in this paper, which can be implemented by swapping qubits with low circuit complexity. The quantum version of discrete Baker map is deduced and the corresponding quantum circuit is designed. The simulation results show that the scrambling algorithm has the characteristic of long period, which can further enhance the security of quantum image encryption algorithms. Besides, for generalized discrete Baker maps, the conditions that they can be implemented by swapping qubits are given. Moreover, the number of discrete Baker maps satisfying the conditions is also calculated.

Download Full-text