Data security and privacy act vital tasks in our daily lives. Traditional cryptosystems may be hacked amidst the growth of quantum resources. Consequently, we need new cryptosystems its construction is based on quantum concepts. In this work, we proposed a novel image cryptosystem using quantum walks. We employ a diversity of tools for experimental assessment of the presented cryptosystem including correlation analysis, histogram analysis, Shannon entropy analysis, UACI and NPCR analyses, Key sensitivity analysis, and occlusion analysis. These metrics show the advantages of our cryptosystem over some robust state-of-art cryptosystems.
Data security and privacy act vital tasks in our daily lives. Traditional cryptosystems may be hacked amidst the growth of quantum resources. Consequently, we need new cryptosystems its construction is based on quantum concepts. In this work, we proposed a novel image cryptosystem using quantum walks. We employ a diversity of tools for experimental assessment of the presented cryptosystem including correlation analysis, histogram analysis, Shannon entropy analysis, UACI and NPCR analyses, Key sensitivity analysis, and occlusion analysis. These metrics show the advantages of our cryptosystem over some robust state-of-art cryptosystems.
The secure storage and transmission of healthcare data have become a critical concern due to their increasing use in the diagnosis and treatment of various diseases. Medical images contain confidential patient information, and unauthorized access to or modification of these images can have severe consequences. Chaotic maps are commonly used for constructing medical image cipher systems, but with the growth of quantum technology, these systems may become vulnerable. To address this issue, a new medical image cipher algorithm based on cascading quantum walk with Chebyshev map has been presented in this paper. The proposed system has been tested and found to have high levels of security and efficiency, with UACI, NPCR, Chi-square, and global information entropy values averaging at 33.48095%, 99.62984%, 248.92128, and 7.99923, respectively.
To secure and protect the photos from unfair tactics, the encryption process is used. the advent of the digital era has made it exceedingly easy to hack any data kept on the cloud. Encryption is critical to ensuring communication security, which is a crucial issue. There are numerous photo encryption methods that mostly rely on chaotic logistic maps; however, they have downsides such a small key space and low security. Current analysis introduced experimental results of quantum chaotic cryptosystem,3D-Chaotic map and quantum chaotic logistic map. This paper we measure image encryption parameters are Entropy, structural similarity index measure, combined average changing intensity and net pixel change rate which defines utilization of suitable image encryption approaches. For the cypher and the original image, we quantify the correlation coefficient value in both the horizontal and vertical positions with comparison of all three existing Approach-es performance. The scientific and practical economic results reveal that the quantum chaotic cryptosystem has outstanding performance and in future with utilization of advanced Approaches we can resist various cryptographic attacks.
Quantum image encryption (QIE) loads a digital image into qubits and ciphers it with unitary circuits, usually keyed by chaotic maps, quantum walks or quantum random numbers. This review follows the field from an early geometric-transformation scheme (2013) to designs executed on 127-qubit IBM processors (2025). We organise the literature by image representation (FRQI, NEQR, amplitude encoding), confusion and diffusion mechanism, key source and validation level, and we compare recent schemes on entropy, NPCR, UACI, correlation and key space. Reported statistics sit close to their ideals almost everywhere; recent quantum-walk and chaos-based designs report NPCR of 99.6 to 99.97% and UACI of 33.5 to 33.9%, so these metrics no longer separate strong schemes from weak ones. Three gaps stand out. Most evidence comes from classical simulation. The secret usually sits in a classical key generator rather than in the quantum circuit. And loading an image into qubits, then reading it back, remains the main hardware bottleneck. Hybrid designs that distribute keys with BB84 and cipher the image classically offer the most deployable route today. We close with a research agenda: attack-based benchmarks, error-aware hardware validation, cheaper state preparation and explicit security definitions.
Smart systems and technologies have become integral parts of modern society. Their ubiquity makes it paramount to prioritise securing the privacy of data transferred between smart devices. Visual encryption is a technique employed to obscure images by rendering them meaningless to evade attention during transmission. However, the astounding computing power ascribed to quantum technology implies that even the best visually encrypted systems can be effortlessly violated. Consequently, the physical realisation quantum hardware portends great danger for visually encrypted date on smart systems. To circumvent this, our study proposes the integration of quantum walks (QWs) as a cryptographic mechanism to forestall violation of the integrity of images on smart systems. Specifically, we use QW first to substitute the original image and to subsequently permutate and embed it onto the reference image. Based on this structure, our proposed quantum walks visually meaningful cryptosystem facilities confidential transmission of visual information. Simulation-based experiments validate the performance of the proposed system in terms of visual quality, efficiency, robustness, and key space sensitivity, and by that, its potential to safeguard smart systems now and as we transition to the quantum era.
Background: The growth in the field of communication has enabled the people at miles apart to communicate easily.Once the online sharing of information is made possible.It is necessary to ensure about the security of the information that is shared.Materials and Methods: In this study, three levels of encryption process has been carried out.Quantum Key Distribution(QKD) with bit XOR forms the first level of encryption.Flipping and swapping of the ciphered block images were done using quantum walk principle forms the second and the third level of encryption.Results and Discussion: To prove the robustness of the proposed scheme, image encryption metrices like horizontal, vertical, diagonal correlations, No. of Pixel Change Rate (NPCR), Unified Average Changing Intensity(UACI) were estimated and compared with the available literature.Conclusion: The QKD and quantum walks forms the basic level of image encryption and offers NPCR 99.68 and UACI of 30.50.Flipping, swapping and bit XOR of the ciphered block images were done.To verify the robustness of the proposed method and the values are found to be better.
Abstract The rapid development of quantum computing poses a serious threat to traditional encryption technologies, especially in the field of image security, where existing encryption schemes struggle to withstand quantum attacks. Therefore, quantum image encryption research is crucial. In the field of quantum image encryption, keys with high randomness and high security are essential. To address the issue of insufficient randomness in quantum walks in low-dimensional spaces, this paper proposes two solutions: the high-dimensional quantum walk paradigm and the entropy-increasing circuit. The high-dimensional quantum walk paradigm enhances the complexity of random sequences by expanding the dimensions of quantum walks, while the entropy-increasing circuit boosts the entropy of the key through quantum operations, thereby improving its randomness and resistance to attacks. To verify the random performance of the entropy-increased key, it is applied to quantum image encryption, with the specific circuit implementation of the encryption process provided. Finally, experimental analysis demonstrates the security of the algorithm.