A Novel Chaos-Based Encryption Technique with Parallel Processing Using CUDA for Mobile Powerful GPU Control Center
Open accessThe DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Abstract
Chaotic systems possess unique properties that can be leveraged for cybersecurity. These properties stem from the complex and unpredictable nature of images, which makes it challenging for systems to interpret them. When combined with CUDA, chaotic systems benefit from high-efficiency parallel processing capabilities, allowing for the rapid and secure handling of large data sets. Therefore, chaotic systems can be effectively used to securely store and conceal images. In this study, a CUDA-supported chaos-based parallel processing encryption mechanism for mobile control centers is developed. Encryption processes leverage the powerful GPU of the control center. This allows for the fast encryption and decryption of image data received from multiple devices connected to the control center via wired or wireless connections. For encryption, the Logistic Map is used to generate random numbers. Using this map, image data is subjected to XOR operations, encrypting the R, G, B, and Gray Scale channels of the images. Initially, an analysis of the numbers generated from this map is conducted, followed by a detailed explanation of the encryption technique. The technique is then applied to image data, and image analyses are performed. Finally, the performance of the encryption technique is compared with other studies, and encryption speeds are examined. The results show that the new encryption technique provides significantly fast encryption and security levels comparable to other studies. The key discovery of this research is that the devised mechanism is well-suited for parallel processing, allowing for rapid image encryption using the proposed method. For encrypting large IoT files, random number generation is initially performed, followed by statistical tests. Subsequently, encryption is executed using the developed algorithm, and security analyses are conducted. The performance of the proposed mechanism is compared with other studies in the literature, and the results from image analysis and encryption performance demonstrate that the developed mechanism can be effectively used with high security for IoT applications.
Overview
CoChat Summary
## TL;DR
The paper proposes a CUDA-supported chaos-based encryption mechanism for mobile control centers, using the Logistic Map and XOR operations to encrypt image channels. It claims fast encryption with security comparable to other studies and suitability for IoT image/file encryption.
## Key findings
- The method uses the Logistic Map to generate random numbers and applies XOR encryption to the R, G, B, and Gray Scale channels of images.
- The paper reports that the proposed technique provides “significantly fast encryption” with security levels comparable to other studies.
- It states that the mechanism is well-suited for parallel processing, enabling rapid image encryption using the control center’s GPU.
- For large IoT files, the paper says it performs random number generation, statistical tests, encryption, and security analyses, and concludes the mechanism can be used effectively with high security for IoT applications.
## Methods
- Design: A CUDA-supported chaos-based parallel processing encryption mechanism for mobile control centers; encryption and decryption are performed using the control center’s GPU.
- Data/sample: The text says the technique is applied to image data and separately to large IoT files, but does not state a specific dataset, image count, or file sample size.
- Main analysis: The study first analyzes the numbers generated by the Logistic Map, then performs image analyses and security analyses, and compares encryption performance with other studies in the literature.
## Limitations
- The paper states comparison with other studies, but does not provide the specific benchmark names, dataset details, or numeric performance results in the provided text.
- The text makes evident that the summary is incomplete because the excerpt ends mid-sentence and does not include the full results section; this limits what can be verified from the provided text.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures












Verification
Claims the paper makes
0 Valid · 0 Not valid · 0 Not checked · 7 Own results and interpretations
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The results show that the new encryption technique provides significantly fast encryption and security levels comparable to other studies.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The results show that the new encryption technique provides significantly fast encryption and security levels comparable to other studies.”
boostedstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The key discovery of this research is that the devised mechanism is well-suited for parallel processing, allowing for rapid image encryption using the proposed method.”
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“the results from image analysis and encryption performance demonstrate that the developed mechanism can be effectively used with high security for IoT applications.”
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The key discovery of this research is that the devised mechanism is well-suited for parallel processing, allowing for rapid image encryption using the proposed method.”
boostedstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
1 more claim
Create a free account to see all 7 claims and every source verdict.
- Probably not a substantial claim. 1
Citations
Cites
Kashyap, P. K., Kumar, S., Jaiswal, A., Prasad, M., & Gandomi, A. H. (2021) · IEEE Sensors Journal · doi:10.1109/jsen.2021.3069266 · Cited by 271
A Review on Applications of Chaotic Maps in Pseudo-Random Number Generators and Encryption
Naik, R. B., & Singh, U. (2024) · Annals of Data Science · doi:10.1007/s40745-021-00364-7 · Cited by 190
Adaptive chaotic maps and their application to pseudo-random numbers generation
Tutueva, A. V., Nepomuceno, E. G., Karimov, A. I., Andreev, V. S., & Butusov, D. N. (2020) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2020.109615 · Cited by 164
Internet of Robotic Things in Smart Domains: Applications and Challenges
Romeo, L., Petitti, A., Marani, R., & Milella, A. (2020) · Sensors · doi:10.3390/s20123355 · Cited by 161
Singh, R., Gehlot, A., Akram, S. V., Gupta, L. R., Jena, M. K., Prakash, C., Singh, S., & Kumar, R. (2021) · Sustainability · doi:10.3390/su13137327 · Cited by 158
A lightweight chaos-based encryption scheme for IoT healthcare systems
Clemente-López, D., Rangel‐Magdaleno, J., & Munoz-Pacheco, J. M. (2023) · Internet of Things · doi:10.1016/j.iot.2023.101032 · Cited by 96
A new parallel image cryptosystem based on 5D hyper-chaotic system
Yuan, H.-M., Liu, Y., Lin, T., Hu, T., & Gong, L.-H. (2017) · Signal Processing Image Communication · doi:10.1016/j.image.2017.01.002 · Cited by 81
Pseudo-random bit generator based on multi-modal maps
García-Martínez, M., & Campos-Cantón, E. (2015) · Nonlinear Dynamics · doi:10.1007/s11071-015-2303-y · Cited by 67
Man, Z., Li, J., Di, X., Liu, X., Zhou, J., Jia, W., & Zhang, X. (2021) · Multimedia Tools and Applications · doi:10.1007/s11042-021-10979-w · Cited by 54
A fast parallel batch image encryption algorithm using intrinsic properties of chaos
Song, W., Fu, C., Tie, M., Sham, C., Liu, J., & Ma, H.-F. (2022) · Signal Processing Image Communication · doi:10.1016/j.image.2021.116628 · Cited by 54
Research works printed but not linked: 1
- Koyuncu, İ., 2014 Kriptolojik uygulamalar için FPGA tabanlı yeni kaotik osilatörlerin ve gerçek rasgele sayı üreteçlerinin tasarımı ve gerçekleştirilmesi. Ph.D. thesis, Sakarya Universitesi (Turkey).
Cited by
Wang, Y., Yin, K., Jin, J., et al. (2026) · Integration · doi:10.1016/j.vlsi.2026.102731 · Cited by 19
The Time Series Classification of Discrete-Time Chaotic Systems Using Deep Learning Approaches
Akmeşe, Ö. F., Emin, B., Alaca, Y., Karaca, Y., & Akgül, A. (2024) · Mathematics · doi:10.3390/math12193052 · Cited by 9
Zhou, Y., Guo, Y., Zhang, W., & Zhao, P. (2025) · Nonlinear Dynamics · doi:10.1007/s11071-025-11673-4 · Cited by 9
“Consequently, chaotic systems are employed in image encryption applications to securely encrypt and decrypt image data [31–33].”
Lightweight Hybrid Chaotic Image Encryption With Spiral Shuffling and S‐Box Diffusion
Dey, D., Bhunia, P., Jana, D. K., Diyasi, S., & Maity, S. (2025) · Security and Privacy · doi:10.1002/spy2.70123 · Cited by 5
Design and analysis of a fractional-order based chaotic map with application in image encryption
Kumar, S., & Sharma, D. (2026) · Franklin Open · doi:10.1016/j.fraope.2026.100580 · Cited by 7
Sağbaş, M., & Taşkıran, Z. G. Ç. (2025) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2025.111288 · Cited by 3
Zhou, Y., Guo, Y., Zhang, W. E., & Zhao, P. (2026) · Nonlinear Dynamics · doi:10.1007/s11071-026-12288-z · Cited by 5
Hosbas, M. Z., Emin, B., Akgül, A., & Kaçar, F. (2025) · Integration · doi:10.1016/j.vlsi.2025.102555 · Cited by 3
Zhang, J., Wei, X., & Liu, Y. (2025) · Nonlinear Dynamics · doi:10.1007/s11071-025-11491-8 · Cited by 1
Bhatti, D. S., Malik, A. W., Choi, H., & Kim, K. (2025) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2025.068360 · Cited by 1
Hamiche, H., Megherbi, O., Kemih, K., et al. (2025) · Chaos Theory and Applications · doi:10.51537/chaos.1650994 · Cited by 1
Sunca, K. Y., Pehli̇van, İ., Boz, A. F., et al. (2025) · Chaos Theory and Applications · doi:10.51537/chaos.1782335 · Cited by 1
Li, W., Li, G., Zhang, J., & Chen, X. (2025) · Physica Scripta · doi:10.1088/1402-4896/ae26fb · Cited by 1
Analog Circuit Implementation of Fractional-Order Modified Chua’s Circuit
Arıcıoğlu, B. (2025) · Chaos Theory and Applications · doi:10.51537/chaos.1633880
Performance Analysis of a Lightweight Image Re‐Encryption Scheme for 5G HetNets
Kakkar, A., & Batra, I. (2025) · Security and Privacy · doi:10.1002/spy2.70078 · Cited by 1
“The R, G, B, and gray scale channels of the images were processed by logistic map and subsequently analyzed, which resulted in fast encryption and was well-suited for IoT applications [41].”
Elsayed, S. H., Abdelsalam, R., Shoman, M. A. I., Alotaibi, R. S., & Reyad, O. (2025) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2025.068429 · Cited by 1
“Chaos theory has enabled the development of advanced encryption techniques across various industries, enhancing data security [8].”
A Lightweight TRNG Based on First‐Order‐Oscillator‐Obfuscated Cross‐Coupled Logic Gates
Xie, J., Yao, L., Wang, Z., et al. (2025) · International Journal of Circuit Theory and Applications · doi:10.1002/cta.70256
“…are inherently deterministic—with their outputs fully determined by initial conditions and thus unsuitable for direct deployment as TRNGs—their sensitivity to initial conditions and inherent unpredictability have made them a research hotspot in the field of random number generation [33, 34].”
Zhou, D., Xu, L., Kengne, J., et al. (2025) · Journal of Circuits Systems and Computers · doi:10.1142/s0218126626500647
Finalise, N. K., Muthukumar, D., Dongmo, E. D., et al. (2026) · Journal of Computational and Nonlinear Dynamics · doi:10.1115/1.4070832
Han, W., Lu, L., Ma, J., Li, Q., & Li, Z. (2026) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2026.103424
Demir, M., Pehli̇van, İ., & Köker, R. (2026) · GAZI UNIVERSITY JOURNAL OF SCIENCE · doi:10.35378/gujs.1776125
Nazish, M., & Banday, M. T. (2026) · Cluster Computing · doi:10.1007/s10586-026-06120-x
Predefined‐Time Synchronization of a New Chaotic Finance System With Sinusoidal Modeling Uncertainty
Johansyah, M. D., Vaidyanathan, S. V., Zheng, S. M., et al. (2026) · Discrete Dynamics in Nature and Society · doi:10.1155/ddns/9552780
Hyperchaos at minimal fractional order in a 3D map: theory and applications
Çalgan, H., Anand, A. N., Muni, S. S., et al. (2026) · Cluster Computing · doi:10.1007/s10586-026-06511-0
Metadata
- Authors
- Kıran, H. E.
- Affiliations
- Hitit Üniversitesi (TR)
- Corresponding author
- Kıran, Harun Emre
- ORCID
- Kıran, Harun Emre
- Venue
- Chaos and Fractals
- Published
- 2024-07-31
- Volume
- 1
- Issue
- 1
- Pages
- 6-18
- ISSN
- 3023-8951 (ISSN-L)
- OpenAlex
- W4401179011
- Semantic Scholar
- 07e9d13f500a9b34c3d332f795039fcea9b5af68
- Cited by
- 25
- References
- 27
- Citations by year
- 2026: 10 · 2025: 14 · 2024: 1
- FWCI
- 3.52
- Type
- journal article
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- Locations
- Chaos and fractals. (publishedVersion, cc-by-nc)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
- Keywords
- chaos-based image encryption, logistic map, GPU parallel processing, CUDA, XOR encryption, random number generation, Internet of Things security, encryption performance, randomness testing
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.
A language model drew the claims from the paper on 2026-09-30, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-09-30 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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.