Cryptanalyzing a class of image encryption schemes based on Chinese remainder theorem
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
As a fundamental theorem in number theory, the Chinese Reminder Theorem (CRT) is widely used to construct cryptographic primitives. This paper investigates the security of a class of image encryption schemes based on CRT, referred to as CECRT. Making use of some properties of CRT, the equivalent secret key of CECRT can be recovered efficiently. The required number of pairs of chosen plaintext and the corresponding ciphertext is only ( 1 + ⌈ ( log 2 L ) / l ⌉ ) , the attack complexity is only O ( L ), where L is the plaintext length and l is the number of bits representing a plaintext symbol. In addition, other defects of CECRT, such as invalid compression function and low sensitivity to plaintext, are reported. The work in this paper will help clarify positive role of CRT in cryptology.
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
SOME 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 1×
“paper.”
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 3×
“It can also be recovered at a very high accuracy even if only some known plaintexts are available [29].”
BackgroundMethodResultSelf-citationOptimal 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 3×
“So, the complexity required in recovering equivalent version of the permutation part is O(L) [28].”
BackgroundMethodResultSelf-citation
Cited by
A novel image encryption scheme based on substitution-permutation network and chaos
Belazi, A., Abd El-Latif, A. A., & Belghith, S. (2016) · Signal Processing · doi:10.1016/j.sigpro.2016.03.021 · Cited by 486
Zhou, N., Li, H., Wang, D., Pan, S., & Zhou, Z. (2015) · Optics Communications · doi:10.1016/j.optcom.2014.12.084 · Cited by 270
Luo, Y., Zhou, R., Liu, J., Cao, Y., & Ding, X. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4251-9 · Cited by 112
Brindha, M., & Ammasai Gounden, N. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2015.09.055 · Cited by 104
Farajallah, M., Assad, S. E., & Deforges, O. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6015-4 · Cited by 19
Metadata
- Authors
- Li, C., Liu, Y., Zhang, L. Y., & Wong, K.-W.
- Venue
- Signal Processing: Image Communication
- Publisher
- Elsevier BV
- Published
- 2014-09
- Volume
- 29
- Issue
- 8
- Pages
- 914-920
- ISSN
- 0923-5965 (ISSN-L)
- OpenAlex
- W2073995884
- Cited by
- 39
- References
- 3
- FWCI
- 4.45
- 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: Cryptanalyzing a class of image encryption schemes based on Chinese remainder theorem. https://app.cochat.ai/papers/10.1016/j.image.2014.06.011
- The paper
- Li, C., Liu, Y., Zhang, L. Y., & Wong, K.-W. (2014). Cryptanalyzing a class of image encryption schemes based on Chinese remainder theorem. Signal Processing: Image Communication. https://doi.org/10.1016/j.image.2014.06.011
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.