Cited by 112Chaos-based Image/Signal EncryptionComputer Science and EngineeringMathematical Dynamics and Fractals

A parallel image encryption algorithm based on the piecewise linear chaotic map and hyper-chaotic map

Luo, Yuling, Zhou, Ronglong, Liu, Junxiu, Cao, Yi, Ding, Xuemei·2018·Nonlinear Dynamics

Integrity signals

Registry

Crossref · 10.1007/s11071-018-4251-9

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Even with the higher number of threads, the GPU is more cost and power efficient than a CPU.

    “Additionally, even with the higher number of threads, the GPU is more cost and power efficient than a CPU [15,27,48].”
  • Exploiting parallelism is one possible strategy to increase the throughput of encryption algorithms.

    “One possible strategy to increase the throughput of encryption algorithms is exploiting parallelism [15, 17, 25, 27, 39, 40, 46-48]”
  • In [27], four kernels are required to cipher an image, increasing the time consumption of the cipher.

    “In [27], four kernels are required to cipher an image, increasing the time consumption of the cipher.”
  • In [27], there are four kernels: one to obtain quantification decimals, the second to obtain the encryption matrix, the third for the permutation operation and the fourth for the diffusion operation.

    “In [27], there are four kernels, one to obtain the quantification decimals, the second to obtain the encryption matrix, the third kernel for the permutation operation and the fourth kernel for the diffusion operation.”
  • In [27], each of the kernels take an average of 0.8 ms to execute.

    “In [27], it is stated that each of the kernels take an average of 0.8 ms to execute”

The citation lists haven’t been fetched yet

References 48 · Cited by 112

Authors
Luo, Y., Zhou, R., Liu, J., Cao, Y., & Ding, X.
Affiliations
  • Guangxi Normal University (CN)
  • University of Surrey (GB)
  • Fujian Normal University (CN)
Corresponding author
Liu, Junxiu
Venue
Nonlinear Dynamics
Published
2018-04-10
Volume
93
Issue
3
Pages
1165-1181
ISSN
  • 0924-090X (ISSN-L)
  • 1573-269X
OpenAlex
W2797914347
Cited by
112
References
48
Citations by year
2026: 1 · 2025: 5 · 2024: 13 · 2023: 14 · 2022: 15 · 2021: 19 · 2020: 25 · 2019: 18 · 2018: 2
FWCI
7.75
Type
journal article
Language
en
Open access
closed
Locations
  • Nonlinear Dynamics (publishedVersion)
  • Surrey Research Insight Open Access (The University of Surrey) (submittedVersion)
Funders
  • National Natural Science Foundation of China (61661008)
  • Natural Science Foundation of China (61603104)
  • Natural Science Foundation of Guangxi Province (2017GXNSFAA198180, 2015GXNSFBA139256, 2016GXNSFCA380017)
  • Overseas 100 Talents Program of Guangxi Higher Education
  • Guangxi University of China (KY2016YB059)
  • Guangxi Key Lab of Multi-source Information Mining & Security (MIMS15-07)
  • Research Foundation of Guangxi Normal University
  • Innovation Project of Guangxi Graduate Education (YCSZ2017055)
  • the Scientific Research Funds for the Returned Overseas Chinese Scholars from State Education Ministry
  • Young Key Program of Education Department from Fujian Province (JZ160425)
  • Department of Education, Fujian Province (I201501005)
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 › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals
Keywords
image encryption, parallel encryption, piecewise linear chaotic map, GPU acceleration, permutation and diffusion, real-time image encryption, encryption speed

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