Cited by 65Chaos-based Image/Signal EncryptionComputer Science and EngineeringCryptographic Implementations and Security

SPRING: a novel parallel chaos-based image encryption scheme

Lee, Wai-Kong, Phan, Raphael C.-W., Yap, Wun-She, Goi, Bok-Min·2018·Nonlinear Dynamics

Integrity signals

Registry

Crossref · 10.1007/s11071-018-4076-6

Cites

55 of 55 references verified0 citation errors · 0 not checkable

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?

  • Completing two rounds of encryption requires only 4(W + H) row and column diffusion, while Ref. [49] requires 8WH diffusion.

    “Completing two rounds of encryption requires only 4(W + H ) row and column diffusion, while Ref. [49] requires 8WH diffusion.”
  • The overall time complexity of the proposed scheme is WH + 4(W + H), which is much lower than that reported in Ref. [8], [49], [51], [54].

    “Overall, the time complexity of the proposed scheme is WH + 4(W + H ), which is much lower than that reported in Ref. [8], [49], [51], [54].”
  • The proposed algorithm needs only WH/2 rounds of permutation to complete encryption, which is much less than reported in Ref. [8] and Ref. [49].

    “To complete encryption, only WH 2 rounds of permutation is needed, which is much less than those reported in Ref. [8] and Ref. [49].”
  • 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]”
  • The proposed cipher's peak throughput of 130.8 GB/s is 43 times higher than the previous best chaotic cipher throughput of 3.04 GB/s in [25].

    “The peak throughput of 130.8 GB/s is 43 times higher than the previous best in literature for chaotic ciphers, which, to the best of our knowledge, is 3.04 GB/s in [25].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Lee, W.-K., Phan, R. C.-W., Yap, W.-S., & Goi, B.-M.
Affiliations
  • Universiti Tunku Abdul Rahman (MY)
  • Universiti Tunku Abdul Rahman Sungai Long Campus (MY)
Corresponding author
Lee, Wai-Kong
Venue
Nonlinear Dynamics
Published
2018-01-20
Volume
92
Issue
2
Pages
575-593
ISSN
  • 0924-090X (ISSN-L)
  • 1573-269X
OpenAlex
W2787079824
Cited by
65
References
55
Citations by year
2025: 4 · 2024: 8 · 2023: 8 · 2022: 10 · 2021: 13 · 2020: 10 · 2019: 9 · 2018: 3
FWCI
4.38
Type
journal article
Language
en
Open access
closed
Locations
  • Nonlinear Dynamics (publishedVersion)
  • Siti Hasmah Digital Library-MMU Institutiona Repository (Multimedia University) (acceptedVersion)
Funders
  • MOSTI eScience (01-02-11-SF0189)
  • Universiti Tunku Abdul Rahman Research Fund (IPSR/RMC/UTARRF/2016-C2/L04, IPSR/RMC/UTARRF/2016-C1/G1)
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 › Artificial Intelligence › Cryptographic Implementations and Security
Keywords
image encryption, chaos-based cryptography, parallel encryption, GPU acceleration, many-core architectures, permutation-diffusion, 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