A chaotic image encryption scheme owning temp-value feedback
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Many round-based chaotic image encryption algorithms employ the permutation–diffusion structure. This structure has been found insecure when the iteration round is equal to one and the secret permutation of some existing schemes can be recovered even a higher round is adopted. In this paper, we present a single round permutation–diffusion chaotic cipher for gray image, in which some temp-value feedback mechanisms are introduced to resist the known attacks. Specifically, we firstly embed the plaintext feedback technique in the permutation process to develop different permutation sequences for different plain-images and then employ plaintext/ciphertext feedback for diffusion to generate equivalent secret key dynamically. Experimental results show that the new scheme owns large key space and can resist the differential attack. It is also efficient.
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
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 5×
“It is easy to prove that a random gray-scale image with uniformly distributed pixels over the interval [0, 255] can achieve the ideal Shannon entropy 8.”
BackgroundMethodInfluentialSOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119 · cited 2×
“In [20], some basic requirements for evaluating the chaotic encryption algorithms are concluded.”
BackgroundSymmetric Ciphers Based on Two-Dimensional Chaotic Maps
Fridrich, J. (1998) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812749800098x · Cited by 1,917 · cited 4×
“In addition, it is reported in [21] that the equivalent key of several permutation-diffusion image ciphers, such as those suggested in [2, 4, 8, 22], can be recovered when only one encryption round is applied.”
BackgroundMethodInfluentialA 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 3×
“In addition, it is reported in [21] that the equivalent key of several permutation-diffusion image ciphers, such as those suggested in [2, 4, 8, 22], can be recovered when only one encryption round is applied.”
BackgroundMethodA novel image encryption scheme based on improved hyperchaotic sequences
Zhu, C. (2012) · Optics Communications · doi:10.1016/j.optcom.2011.08.079 · Cited by 432
Li, S., Li, C., Chen, G., Bourbakis, N. G., & Lo, K.-T. (2008) · Signal Processing: Image Communication · doi:10.1016/j.image.2008.01.003 · Cited by 339 · cited 1×
“Thus makes this kind of permutation tough for the known/chosen plaintext attack proposed in [13, 17].”
BackgroundMulti chaotic systems based pixel shuffle for image encryption
Huang, C. K., & Nien, H. H. (2009) · Optics Communications · doi:10.1016/j.optcom.2009.02.044 · Cited by 325 · cited 2×
“Keywords: image encryption, Chen system, Logistic map, permutation, diffusion”
BackgroundCRYPTANALYSIS OF FRIDRICH'S CHAOTIC IMAGE ENCRYPTION
SOLAK, E., ÇOKAL, C., YILDIZ, O. T., & BIYIKOĞLU, T. (2010) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127410026563 · Cited by 215
Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks
Li, C., & Lo, K.-T. (2011) · Signal Processing · doi:10.1016/j.sigpro.2010.09.014 · Cited by 213 · cited 1×
“Thus makes this kind of permutation tough for the known/chosen plaintext attack proposed in [13, 17].”
Background
Cited by
Image encryption using 2D Logistic-adjusted-Sine map
Hua, Z., & Zhou, Y. (2016) · Information Sciences · doi:10.1016/j.ins.2016.01.017 · Cited by 736
Sine Chaotification Model for Enhancing Chaos and Its Hardware Implementation
Hua, Z., Zhou, B., & Zhou, Y. (2019) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2018.2833049 · Cited by 266
Cryptanalysis of a DNA-based image encryption scheme
Chen, J., Chen, L., & Zhou, Y. (2020) · Information Sciences · doi:10.1016/j.ins.2020.02.024 · Cited by 195
Image encryption based on modified Henon map using hybrid chaotic shift transform
Sheela, S. J., Suresh, K. V., & Tandur, D. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-018-5782-2 · Cited by 122
Improved known-plaintext attack to permutation-only multimedia ciphers
Zhang, L. Y., Liu, Y., Wang, C., Zhou, J., Zhang, Y., & Chen, G. (2018) · Information Sciences · doi:10.1016/j.ins.2017.11.021 · Cited by 75
Self-citation
Metadata
- Authors
- Zhang, L. Y., Hu, X., Liu, Y., Wong, K.-W., & Gan, J.
- Venue
- Communications in Nonlinear Science and Numerical Simulation
- Publisher
- Elsevier BV
- Published
- 2014-10
- Volume
- 19
- Issue
- 10
- Pages
- 3653-3659
- ISSN
- 1007-5704 (ISSN-L)
- OpenAlex
- W2012056600
- Cited by
- 112
- References
- 9
- FWCI
- 14.54
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A chaotic image encryption scheme owning temp-value feedback. https://app.cochat.ai/papers/10.1016/j.cnsns.2014.03.016
- The paper
- Zhang, L. Y., Hu, X., Liu, Y., Wong, K.-W., & Gan, J. (2014). A chaotic image encryption scheme owning temp-value feedback. Communications in Nonlinear Science and Numerical Simulation. https://doi.org/10.1016/j.cnsns.2014.03.016
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.