CoChat

A Novel Chaos-Based Encryption Technique with Parallel Processing Using CUDA for Mobile Powerful GPU Control Center

Open access
Kıran, Harun Emre · 2024 · Chaos and Fractals

The 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

Crossref · 10.69882/adba.chf.2024072

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Image 1
From the PDF
Image 2
From the PDF
Figure 1 Time series of the values generated by the Logistic Map over 250 iterations. The plot illustrates the absence of periodicity, indicating the chaotic nature of the Logistic Map for r = 3.9 .
Figure 1 Time series of the values generated by the Logistic Map over 250 iterations. The plot illustrates the absence of periodicity, indicating the chaotic nature of the Logistic Map for r = 3.9 .From the PDF
Image 4
From the PDF
Image 5
From the PDF
Figure 4 Bifurcation diagram of the Logistic Map for r values ranging from 2 to 4. The population ratio x is plotted against the growth rate r .
Figure 4 Bifurcation diagram of the Logistic Map for r values ranging from 2 to 4. The population ratio x is plotted against the growth rate r .From the PDF
Figure 5 The wired or wireless connection structure of the mobile control center with other devices.
Figure 5 The wired or wireless connection structure of the mobile control center with other devices.From the PDF
Figure 6 Encryption of each channel in RGB images or Gray-Scale image.
Figure 6 Encryption of each channel in RGB images or Gray-Scale image.From the PDF
Image 9
From the PDF
Figure 7 Comparative Histogram Analysis of Original and Encrypted Image Channels
Figure 7 Comparative Histogram Analysis of Original and Encrypted Image ChannelsFrom the PDF
Image 11
From the PDF
Image 12
From the PDF

Verification

Claims the paper makes

0 Valid · 0 Not valid · 0 Not checked · 7 Own results and interpretations

1 more claim

Create a free account to see all 7 claims and every source verdict.

See all claims — free account
  • Probably not a substantial claim. 1

Create a free account to see these claims.

Citations

Cites

Show all 27 references

Research works printed but not linked: 1

  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

See all 25

Metadata

Authors
Kıran, H. E.
Affiliations
Hitit Üniversitesi (TR)
Corresponding author
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
Cited by
25
References
27
Citations by year
2026: 10 · 2025: 14 · 2024: 1
FWCI
3.52
Type
journal article
Language
en
Open access
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.