Secure Data Encryption Based on Quantum Walks for 5G Internet of Things Scenario
Abstract
Fifth generation (5G) networks are the base communication technology for connecting objects in the Internet of Things (IoT) environment. 5G is being developed to provide extremely large capacity, robust integrity, high bandwidth, and low latency. With the development and innovating new techniques for 5G-IoT, it surely will drive to new enormous security and privacy challenges. Consequently, secure techniques for data transmissions will be needed as the basis for 5G-IoT technology to address these arising challenges. Therefore, various traditional security mechanisms are provided for 5G-IoT technologies and most of them are built on mathematical foundations. With the growth of quantum technologies, traditional cryptographic techniques may be compromised due to their mathematical computation based construction. Quantum walks (QWs) is a universal quantum computational model, which possesses inherent cryptographic features that can be utilized to build efficient cryptographic mechanisms. In this paper, we use the features of quantum walk to construct a new S-box method which plays a significant role in block cipher techniques for 5G-IoT technologies. As an application of the presented S-box mechanism and controlled alternate quantum walks (CAQWs) for 5G-IoT technologies a new robust video encryption mechanism is proposed. As well as to fulfill needs of encryption for varied files in 5G-IoT, we utilize the features of quantum walk to propose a novel encryption strategy for secure…
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The LAP value of the proposed S-box is 0.125, lower and thus better than the S-boxes investigated in [61]-[64], [68]-[72], [75], [76], [82], and [83].
“The LAP value of 0.125 is lower and thus better than S-boxes investigated in [61] [64], [68] [72], [75], [76], [82], [83].”
From Bijective S-Boxes Method Using Improved Chaotic Map-Based Heuristic Search and Algebraic Group Structures (2020) · cites this paper as [83]
Cites
Universal quantum computation using the discrete-time quantum walk
Lovett, N. B., Cooper, S., Everitt, M., Trevers, M., & Kendon, V. (2010) · Physical Review A · doi:10.1103/physreva.81.042330 · Cited by 510 · see citing works
Kiktenko, E. O., Pozhar, N. O., Anufriev, M. N., Trushechkin, A. S., Yunusov, R. R., Kurochkin, Y. V., Lvovsky, A. I., & Fedorov, A. K. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aabc6b · Cited by 264 · see citing works
Depreciating motivation and empirical security analysis of chaos-based image and video encryption
Preishuber, M., Hutter, T., Katzenbeisser, S., & Uhl, A. (2018) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2812080 · Cited by 256 · see citing works
A novel image encryption scheme based on an elliptic curve
Hayat, U., & Azam, N. A. (2019) · Signal Processing · doi:10.1016/j.sigpro.2018.10.011 · Cited by 178 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
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 · see citing works
Self-citationAhmad, M., Al-Solami, E., Alghamdi, A. M., & Yousaf, M. A. (2020) · IEEE Access · doi:10.1109/access.2020.3001868 · Cited by 67 · see citing works
“The remarkable achievement of our proposed research finding is that with proposed method we are able to get the S-box having nonlinearity of 114 which is pretty higher than all 8 × 8 S-boxes available in literature [19], [22], [29], [40], [42], [61]–[83] including AES S-boxes where it’s bound is 112.”
BackgroundMethodInfluentialDeng, X., Chen, Z., Long, B., Liu, T., Wu, X., Zheng, Z., Zou, S., & Cao, C. (2025) · Physica Scripta · doi:10.1088/1402-4896/adb918 · Cited by 16 · see citing works
- Authors
- El-Latif, A. A. A., Abd-El-Atty, B., Mazurczyk, W., Fung, C., & Venegas-Andraca, S. E.
- Affiliations
- Menoufia University (EG)
- Warsaw University of Technology (PL)
- Virginia Commonwealth University (US)
- Tecnológico de Monterrey (MX)
- ORCID
- Venue
- IEEE Transactions on Network and Service Management
- Published
- 2020-03
- Volume
- 17
- Issue
- 1
- Pages
- 118-131
- ISSN
- 1932-4537 (ISSN-L)
- 2373-7379
- OpenAlex
- W3004307973
- Cited by
- 217
- References
- 4
- Citations by year
- 2026: 13 · 2025: 16 · 2024: 24 · 2023: 44 · 2022: 59 · 2021: 42 · 2020: 19
- FWCI
- 16.11
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Network and Service Management (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Keywords
- quantum walks, 5G, Internet of Things security, S-box design, block cipher, video encryption, file encryption, quantum cryptography, secure data transmission
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
