Novel Image Encryption based on Quantum Walks
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Quantum computation has achieved a tremendous success during the last decades. In this paper, we investigate the potential application of a famous quantum computation model, i.e., quantum walks (QW) in image encryption. It is found that QW can serve as an excellent key generator thanks to its inherent nonlinear chaotic dynamic behavior. Furthermore, we construct a novel QW-based image encryption algorithm. Simulations and performance comparisons show that the proposal is secure enough for image encryption and outperforms prior works. It also opens the door towards introducing quantum computation into image encryption and promotes the convergence between quantum computation and image processing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
ON THE DERIVATION OF A “CHAOTIC” ENCRYPTION ALGORITHM
Matthews, R. (1989) · Cryptologia · doi:10.1080/0161-118991863745 · Cited by 1,044
TestU01: A C library for empirical testing of random number generators
L'Ecuyer, P., & Simard, R. (2007) · ACM Transactions on Mathematical Software · doi:10.1145/1268776.1268777 · Cited by 1,014
A Statistical Measure of Complexity
López-Ruiz, R., Mancini, H. L., & Calbet, X. (1995) · Physics Letters A · doi:10.1016/0375-9601(95)00867-5 · Cited by 920
A novel image encryption scheme based on improved hyperchaotic sequences
Zhu, C. (2012) · Optics Communications · doi:10.1016/j.optcom.2011.08.079 · Cited by 432
Double image encryption by using iterative random binary encoding in gyrator domains
Liu, Z., Guo, Q., Xu, L., Ahmad, M. A., & Liu, S. (2010) · Optics Express · doi:10.1364/oe.18.012033 · Cited by 286
Fast encryption of image data using chaotic Kolmogorov flows
Scharinger, J. (1998) · Journal of Electronic Imaging · doi:10.1117/1.482647 · Cited by 186
An efficient self-adaptive model for chaotic image encryption algorithm
Huang, X., & Ye, G. (2014) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2014.04.012 · Cited by 72
Cited by
Secure Data Encryption Based on Quantum Walks for 5G Internet of Things Scenario
El-Latif, A. A. A., Abd-El-Atty, B., Mazurczyk, W., Fung, C., & Venegas-Andraca, S. E. (2020) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2020.2969863 · Cited by 217
Abd El-Latif, A. A., Abd-El-Atty, B., Amin, M., & Iliyasu, A. M. (2020) · Scientific Reports · doi:10.1038/s41598-020-58636-w · Cited by 155
On the security of a class of diffusion mechanisms for image encryption
Zhang, L. Y., Liu, Y., Pareschi, F., Zhang, Y., Wong, K.-W., Rovatti, R., & Setti, G. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2682561 · Cited by 132
Providing End-to-End Security Using Quantum Walks in IoT Networks
El-Latif, A. A. A., Abd-El-Atty, B., Venegas-Andraca, S. E., Elwahsh, H., Piran, M. J., Bashir, A. K., Song, O.-Y., & Mazurczyk, W. (2020) · IEEE Access · doi:10.1109/access.2020.2992820 · Cited by 89
“Also, Yang et al [33] designed an image encryption mechanism using two-walker QW.”
MethodSPRING: a novel parallel chaos-based image encryption scheme
Lee, W.-K., Phan, R. C.-W., Yap, W.-S., & Goi, B.-M. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4076-6 · Cited by 65
“…pixel confusion techniques [4–7], bit-level permutation [8–12], diffusion strategy [13], plain image-related parameters [14,15], enhanced keystream generators [16], coupled map lattice [17], shuffling mechanism [18], cosine number transform [19], binary arithmetic coding [20] and quantum walk [21].”
BackgroundMethodA new parallel processing architecture for accelerating image encryption based on chaos
Yavuz, E. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2021.103056 · Cited by 42
Cryptanalysis and design for a family of plaintext-non-delayed chaotic ciphers
Wang, Q., & Yu, S. (2025) · arXiv · doi:10.48550/arxiv.2509.11158
Metadata
- Authors
- Yang, Y.-G., Pan, Q.-X., Sun, S.-J., & Xu, P.
- Venue
- Scientific Reports
- Published
- 2015-01-14
- Volume
- 5
- Issue
- 1
- Pages
- 7784-7784
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W1965498832
- Cited by
- 98
- References
- 9
- FWCI
- 8.95
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.