Color Image Encryption Algorithm Based on Dynamic Chaos and Matrix Convolution
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
This paper proposes a color image encryption algorithm based on a cloud model Fibonacci chaotic system, as well as a matrix convolution operation that can protect image content effectively and safely. The algorithm combines the cloud model with the generalized Fibonacci, creating a new complex chaotic system that realizes the dynamic random variation of chaotic sequences. The chaotic sequence is used to scramble the pixel coordinates of the mosaic images of the R, G, and B components of the color image. Then, the chaotic sequence value is used as a matrix convolution cloud algorithm that alternately updates the input value of the matrix convolution operation and the pixel value to obtain the permutation transformation of the original pixel value. Finally, the pixel values of the replacement and cloud model Fibonacci chaotic sequence and the pixel values of the front (rear) adjacent pixel points are subjected to a two-way exclusive XOR operation. Realizing the change of the arbitrary pixel value causes a chain transformation of the pixel values of all of the pixel points, and sequentially generates an encrypted image. Experiments show that the histogram of the encrypted image is smoother and adjacent pixels of the image have low correlation. In addition, this algorithm can resist attack experiments such as differential attack, select plaintext attack and noise attack and provides high encryption security, high anti-interference, and strong robustness. The dynamic chaotic system is used to realize the color image encryption of the dynamic key, and the encryption algorithm has higher security and the validity of the algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A new 1D chaotic system for image encryption
Zhou, Y., Bao, L., & Chen, C. L. P. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.10.034 · Cited by 859
Local Shannon entropy measure with statistical tests for image randomness
Wu, Y., Zhou, Y., Saveriades, G., Agaian, S., Noonan, J. P., & Natarajan, P. (2013) · Information Sciences · doi:10.1016/j.ins.2012.07.049 · Cited by 722 · cited 1×
“In [46], a new statistical test of image randomness based on local Shannon entropy measure is proposed, which is an extension of traditional Shannon entropy.”
MethodA novel colour image encryption algorithm based on chaos
Wang, X., Teng, L., & Qin, X. (2012) · Signal Processing · doi:10.1016/j.sigpro.2011.10.023 · Cited by 715
A new color image encryption using combination of the 1D chaotic map
Pak, C., & Huang, L. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.03.011 · Cited by 632
A novel chaotic block image encryption algorithm based on dynamic random growth technique
Wang, X., Liu, L., & Zhang, Y. (2015) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2014.08.005 · Cited by 434
Asymmetric color image encryption scheme using 2D discrete-time map
Liu, H., & Kadir, A. (2015) · Signal Processing · doi:10.1016/j.sigpro.2015.01.016 · Cited by 170
Enayatifar, R., Sadaei, H. J., Abdullah, A. H., Lee, M., & Isnin, I. F. (2015) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2015.03.007 · Cited by 144
Cited by
Image encryption based on a combination of multiple chaotic maps
Elkandoz, M. T., & Alexan, W. (2022) · Multimedia Tools and Applications · doi:10.1007/s11042-022-12595-8 · Cited by 172
“[47] 2203 [43] 2187 [54] 1056 [49] 2256 [13] 2345 [19] 2219”
Alexan, W., Alexan, N., & Gabr, M. (2023) · Fractal and Fractional · doi:10.3390/fractalfract7040287 · Cited by 144
Qian, X., Yang, Q., Li, Q., Liu, Q., Wu, Y., & Wang, W. (2021) · IEEE Access · doi:10.1109/access.2021.3073514 · Cited by 90
“Therefore, our scheme has the enough key space to defense any exhaustive attack, and the key space is larger than some other proposed encryption algorithms in [2], [11], [25].”
BackgroundMethodResultInfluentialGabr, M., Korayem, Y., Chen, Y.-L., Yee, P. L., Ku, C. S., & Alexan, W. (2023) · IEEE Access · doi:10.1109/access.2023.3326848 · Cited by 79
Image Encryption via Base-n PRNGs and Parallel Base-n S-Boxes
Gabr, M., Elias, R., Hosny, K. M., Papakostas, G. A., & Alexan, W. (2023) · IEEE Access · doi:10.1109/access.2023.3301460 · Cited by 72
Metadata
- Authors
- Hu, X., Wei, L., Chen, W., Chen, Q., & Guo, Y.
- Venue
- IEEE Access
- Published
- 2020
- Volume
- 8
- Pages
- 12452-12466
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3000233490
- Cited by
- 102
- References
- 7
- FWCI
- 6.43
- Type
- journal article
- Language
- en
- Open access
- gold
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
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.