A novel colour image encryption scheme using rectangular transform-enhanced chaotic tent maps
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
In recent years, the chaos-based cryptographic algorithms have attracted a lot of attention. Specially, chaotic tent map (CTM)-based schemes show some good performances in randomness properties and security level. However, several shortcomings still can be found from them. In this paper, based on the security analysis of the pure CTM-based scheme, we propose a novel image encryption algorithm by using the combination of the rectangular transform and the CTM principle. It encrypts the three channels of the plain image at the same time, and these channel encryptions associate with each other. In addition, by generating the key streams related to both the secret keys and the plain image, its key-sensitivity has been further improved. The security of the proposed scheme has been verified by security analysis and experimental evaluations, and our results show that many drawbacks of pure CTM-based schemes have been overcome.
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
Image encryption using chaotic logistic map
Pareek, N. K., Patidar, V., & Sud, K. K. (2006) · Image and Vision Computing · doi:10.1016/j.imavis.2006.02.021 · Cited by 1,261
A NOVEL FAST IMAGE ENCRYPTION SCHEME BASED ON 3D CHAOTIC BAKER MAPS
MAO, Y., CHEN, G., & LIAN, S. (2004) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812740401151x · Cited by 611 · cited 1×
“A three dimensional (3D) chaotic cat map is used to design a real-time secure symmetric encryption scheme in [10], while the authors of [11] proposed a fast image encryption scheme by adopting the 3D chaotic baker maps.”
MethodAn image encryption scheme based on chaotic tent map
Li, C., Luo, G., Qin, K., & Li, C. (2017) · Nonlinear Dynamics · doi:10.1007/s11071-016-3030-8 · Cited by 497 · cited 4×
“After briefly reviews the pure CTM-based scheme proposed in [17], in Section II we show its security defects by indicating some well-directed attacking methods.”
BackgroundMethodInfluentialColor image encryption based on hybrid hyper-chaotic system and cellular automata
Yaghouti Niyat, A., Moattar, M. H., & Niazi Torshiz, M. (2017) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2016.10.019 · Cited by 383
Cited by
Novel Medical Image Encryption Scheme Based on Chaos and DNA Encoding
Belazi, A., Talha, M., Kharbech, S., & Xiang, W. (2019) · IEEE Access · doi:10.1109/access.2019.2906292 · Cited by 270
Zhu, C., & Sun, K. (2018) · IEEE Access · doi:10.1109/access.2018.2817600 · Cited by 171
Image Encryption Using Josephus Problem and Filtering Diffusion
Hua, Z., Xu, B., Jin, F., & Huang, H. (2019) · IEEE Access · doi:10.1109/access.2018.2890116 · Cited by 156
A novel chaos-based permutation for image encryption
Alawida, M. (2023) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2023.101595 · Cited by 115
Zhu, C., Wang, G., & Sun, K. (2018) · Symmetry · doi:10.3390/sym10090399 · Cited by 90
“Besides, our improved scheme has better results than References [9,15,23].”
MethodInfluentialImage encryption using block cipher and chaotic sequences
Artiles, J. A. P., Chaves, D. P. B., & Pimentel, C. (2019) · Signal Processing: Image Communication · doi:10.1016/j.image.2019.08.014 · Cited by 77
Improved Cryptanalysis and Enhancements of an Image Encryption Scheme Using Combined 1D Chaotic Maps
Zhu, C., Wang, G., & Sun, K. (2018) · Entropy · doi:10.3390/e20110843 · Cited by 76
“References [25–29] improve the anti-attack performance of a cryptographic algorithm by introducing a plaintext-related mechanism in generating the key streams.”
MethodInfluentialNoise-Resistant Image Encryption Scheme for Medical Images in the Chaos and Wavelet Domain
Shafique, A., Ahmed, J., Rehman, M. U., & Hazzazi, M. M. (2021) · IEEE Access · doi:10.1109/access.2021.3071535 · Cited by 72
A Faster and Robust Artificial Neural Network Based Image Encryption Technique With Improved SSIM
Panigrahy, A. K., Maniyath, S. R., Sathiyanarayanan, M., Dholvan, M., Ramaswamy, T., Hanumanthakari, S., Vignesh, N. A., Kanithan, S., & Swain, R. (2024) · IEEE Access · doi:10.1109/access.2024.3353294 · Cited by 42
Cryptanalysis and Improvement in a Plaintext-Related Image Encryption Scheme Based on Hyper Chaos
Liu, L., Zhang, Z., & Chen, R. (2019) · IEEE Access · doi:10.1109/access.2019.2938181 · Cited by 41
“The method in [38] was also broken by utilizing the chosenplaintext attack.”
MethodA new efficient permutation-diffusion encryption algorithm based on a chaotic map
Moreira Bezerra, J. I., Valduga de Almeida Camargo, V., & Molter, A. (2021) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2021.111235 · Cited by 37
Feng, W., He, Y., Li, H., & Li, C. (2019) · IEEE Access · doi:10.1109/access.2019.2959137 · Cited by 33
“For example, if the secret key consists of two parameters a ∈ [1, 2], b ∈ [1, 2], and the computer representation precision is 10−15, then the key space size is S = 1015 × 1015 = 1030.”
BackgroundMao, N., Tong, X., Zhang, M., & Wang, Z. (2023) · Journal of Real-Time Image Processing · doi:10.1007/s11554-023-01294-8 · Cited by 25
Cryptanalysis and design for a family of plaintext-non-delayed chaotic ciphers
Wang, Q., & Yu, S. (2025) · arXiv · doi:10.48550/arxiv.2509.11158
“…the diffusion function 𝑓 𝐷 in [11–22], [9] and [10] observed that the diffusion functions in [11–14] adopt heterogeneous operations, namely mixtures of modular and XOR operations, whereas those in [15–22] adopt homogeneous operations, including homogeneous modular or homogeneous XOR operations.”
Metadata
- Authors
- wu, X., Zhu, B., Hu, Y., & Ran, Y.
- Venue
- IEEE Access
- Published
- 2017
- Pages
- 1-1
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2604466980
- Cited by
- 150
- References
- 4
- FWCI
- 10.00
- 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.