Optimized quantum computing technique to encrypt medical images

Quantum medical image encryption is one of the new methods to send medical images in an insecure communication channel. The proposed method is based on the flexible representation of quantum images which consists of two phases. In the first phase, the medical image is first interlaced using C-NOT ga...

Full description

Saved in:
Bibliographic Details
Published in:Optical and quantum electronics 2024-03, Vol.56 (3), Article 442
Main Authors: Houshmand, Monireh, Khorrampanah, Mahsa, Alkhudhari, Ali Hamid Muosa
Format: Article
Language:English
Subjects:
Algorithms
Characterization and Evaluation of Materials
Circuit design
Complexity
Computer Communication Networks
Correlation coefficients
Electrical Engineering
Encryption
Entropy
Lasers
Medical imaging
Optical Devices
Optics
Photonics
Physics
Physics and Astronomy
Quantum computing
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Quantum medical image encryption is one of the new methods to send medical images in an insecure communication channel. The proposed method is based on the flexible representation of quantum images which consists of two phases. In the first phase, the medical image is first interlaced using C-NOT gates and then the output of this phase is given to the second phase. In the second phase, one key is defined based on the logical mapping chaos function and the medical image encryption operation is performed based on this key. The output of the second phase is an encrypted image that can only be decrypted by the receiver which has the key. The results of the study of criteria such as histogram, entropy, correlation coefficient of adjacent pixels and correlation diagram show good performance. The entropy value of the proposed method is 99.67 which shows the proposed algorithm has much better performance than previous work. The temporal complexity of the designed quantum circuits is O(n), while the temporal complexity of the previous work is equal to O 2 2 n , which indicates the fast implementation of the proposed algorithm.
ISSN:0306-8919
1572-817X
DOI:10.1007/s11082-023-06041-8