Asymmetric image encryption algorithm based on a new three-dimensional improved logistic chaotic map
Open accessAbstract
Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map (3D-ILM), an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman (RSA) is presented in this paper. In the first stage, a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence, Lyapunov exponent, and Shannon entropy. In the second stage, combined with the public key RSA algorithm, a new key acquisition mathematical model (MKA) is constructed to obtain the initial keys for the 3D-ILM. Consequently, the key stream can be produced depending on the plain image for a higher security. Moreover, a novel process model (NPM) for the input of the 3D-ILM is built, which is built to improve the distribution uniformity of the chaotic sequence. In the third stage, to encrypt the plain image, a pre-process by exclusive OR (XOR) operation with a random matrix is applied. Then, the pre-processed image is performed by a permutation for rows, a downward modulo function for adjacent pixels, a permutation for columns, a forward direction XOR addition-modulo diffusion, and a backward direction XOR addition-modulo diffusion to achieve the final cipher image. Moreover, experiments show that the the proposed algorithm has a better performance. Especially, the number of pixels change rate (NPCR) is close to ideal case 99.6094%, with the unified average changing intensity (UACI) close to 33.4634%, and the…
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?
Guo-Dong Ye and Hui-Shan Wu [114] introduced a 3D ILM chaotic system with large key space and high complexity.
“Recently, Guo-Dong Ye and Hui-Shan Wu [114] introduced a 3D ILM chaotic system, which has large key space and high complexity.”
From Chaos-Based Image Encryption: Review, Application, and Challenges (2023) · cites this paper as [114]
The citation lists haven’t been fetched yet
References 31 · Cited by 22
- Authors
- Ye, G.-D., Wu, H.-S., Huang, X.-L., & Tan, S.-Y.
- Affiliations
- Newcastle University (GB)
- ORCID
- Tan, Syh-Yuan
- Venue
- Chinese Physics B
- Publisher
- IOP Publishing
- Published
- 2023-03-01
- Volume
- 32
- Issue
- 3
- Pages
- 030504
- ISSN
- 1674-1056 (ISSN-L)
- OpenAlex
- W4283786661
- Cited by
- 22
- References
- 31
- Citations by year
- 2026: 1 · 2025: 6 · 2024: 10 · 2023: 5
- FWCI
- 1.72
- Type
- journal article
- Language
- en
- Open access
- green
- doi.org
- Licence
- Locations
- Chinese Physics B (publishedVersion)
- Newcastle University ePrints (Newcastle Univesity)
- 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
- image encryption, public-key cryptography, logistic map, pixel permutation, XOR diffusion, NPCR and UACI, Shannon entropy
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