Fast image encryption algorithm based on parallel computing system
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?
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]”
From A novel single kernel parallel image encryption scheme based on a chaotic map (2024) · cites this paper as [46]
The citation lists haven’t been fetched yet
References 44 · Cited by 414
- Authors
- Wang, X., Feng, L., & Zhao, H.
- Affiliations
- Dalian University of Technology (CN)
- Dalian Maritime University (CN)
- Corresponding author
- Wang, Xingyuan
- Feng, Le
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2019-06
- Volume
- 486
- Pages
- 340-358
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2917426586
- Cited by
- 414
- References
- 44
- Citations by year
- 2026: 8 · 2025: 31 · 2024: 43 · 2023: 61 · 2022: 76 · 2021: 103 · 2020: 67 · 2019: 25
- FWCI
- 30.34
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Information Sciences (publishedVersion)
- Funders
- National Natural Science Foundation of China (61672124, 61370145)
- 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, parallel computing, permutations, diffusion, Arnold cat map, Baker map, parallel diffusion, computational complexity
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
