Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 64 of the 64 references it cites were found in a registry or an index; 9 of the 22 sources its claims cite were checked for support.

Cryptosystem Based on the Elliptic Curve With a High Degree of Resistance to Damage on the Encrypted Images

Open access
Silva-Garcia, Victor Manuel, Flores-Carapia, Rolando, Gonzalez-Ramirez, Marlon David, Vega-Alvarado, Eduardo, Villarreal-Cervantes, Miguel Gabriel · 2020 · IEEE Access

Abstract

In this work, a novel symmetric cryptosystem for image encryption is presented. The Symmetric Cryptosystem of the Elliptic Curve (SCEC) can resist damage to encrypted figures, up to 40% of the original figure. SCEC uses chaos to generate an 8×8 S-box with high nonlinearity to avoid the linear attack. A random permutation is used before starting encryption, making the cryptosystem more robust. For testing, damage according to four types of noise was applied to the encrypted images: additive, multiplicative, Gaussian, or occlusion. The median filter was applied to correct the damage in encrypted images, improving its sharpness, and a new measure, the Similarity Parameter (SP), is proposed to evaluate the difference between the original image and the decrypted image with damage. Several parameters and tests were applied to evaluate the performance of SCEC, from the encryption quality to the resistance to the differential attack. Experimental results indicate that SCEC has high-quality cryptographic properties, very much similar to the corresponding values of AES but with the addition of a high protection to noise damage on the encrypted images.

Overview

CoChat Summary

TL;DR

The paper presents SCEC, a symmetric elliptic-curve image cryptosystem using a chaos-generated 8×8 S-box and a random permutation, designed to resist noise damage to encrypted images up to 40% of image size. It reports cryptographic properties similar to AES and better tolerance than AES-CBC to additive/occlusion damage, with a proposed Similarity Parameter and median filtering.

Key findings

  • SCEC resists damage up to 40% of the encrypted image for four noise types: additive, multiplicative, Gaussian, and occlusion. After applying a 3×3 median filter to images with 40% damage, the Similarity Parameter (SP) was at least 78% and in some cases almost 90% (Table 12); without filtering, additive 40% damage gave SP values such as Donkey red 44.75, Cameraman red 62.69, Jet red 61.73, and Lena red 60.41 (Table 11).
  • Cryptographic metrics were close to ideal: entropy around 7.999 (e.g., Lena red 7.99934, green 7.99936, blue 7.99939), correlation near zero (e.g., Lena red horizontal 0.00342), NPCR ≈99.6% (e.g., Lena red 99.616), UACI ≈33.4% (e.g., Lena red 33.542), and AC ≈50% (e.g., Lena red 49.974). The S-box had nonlinearity 100 and DPA 9.3, compared with AES S-box DPA 9.6.
  • The key set is >2^512 elements, versus 2^256 for AES-256; the discrete logarithm problem is stated as equivalent to factoring an RSA integer of size 2^15000. Average ciphering time for a 512×512 image was 0.2 s, compared with 1.708, 4.750, 4.828, and 3.253 s for cited systems (Table 16).
  • Completely black and completely white test images also produced good NPCR, UACI, and AC values (Table 10).

Methods

  • Design: SCEC is a symmetric Substitution-Permutation-Network with 14 rounds, based on the elliptic curve y² ≡ x³ − kx mod p with p = 2^565 and q > 2^512. The curve is required to be nonsingular, non-supersingular, and not trace one. Chaos is generated with the logistic map using r = 3.88171828182845…; an 8×8 S-box with nonlinearity 100 and DPA < 10 is generated, and a random permutation is applied before encryption. The encryption key K is the integer associated with the SHA-512 chain of the image; schedule keys are generated from elliptic-curve points.
  • Data: 512×512 color images Donkey, Cameraman, Jet, and Lena, plus one completely white and one completely black image. Encrypted images are 513×512 after adding a randomly selected line of bits. Four noise types—Gaussian, additive, multiplicative, and occlusion—were applied at 20%, 30%, and 40% damage; a 3×3 median filter was applied to damaged decrypted images, and the Similarity Parameter (SP) was proposed.
  • Analysis: entropy, correlation coefficient, Discrete Fourier Transform, goodness-of-fit χ² test, NPCR, UACI, AC, and sensitivity via correlation between two cipher operations using keys K and K+1. Results were compared with AES for S-box properties and with AES-CBC for image encryption under damage.

Limitations

  • Stated: the current version ciphers uncompressed BMP images because the research was supported by the Mexican government and its regulation does not allow data loss during encryption of sensitive information. Future work includes compressed image formats such as JPG or PNG, evaluating different filter types, and using the Matlab function GLCM2 for comparison. The paper also notes a potential problem: some values of a require longer computation time to find the generator element α, solved by running the algorithm with several threads.
  • Evident from the text: evaluation is limited to 512×512 color images and four noise types, with no formal security proof beyond the stated attack analyses. Comparisons are split—S-box properties are compared directly to AES, while image encryption under damage is compared to AES-CBC—so full-system equivalence to AES across all metrics is not established.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1109/access.2020.3042475

Cites

64 of 64 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

5 Valid · 2 Not valid · 11 Not checked · 37 Own results and interpretations

24 more claims

Create a free account to see all 55 claims and every source verdict.

See all claims — free account
  • It may state two separate claims as one. 19
  • Probably not a substantial claim. 8

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

4 of 4

Citations

Cites

Show all 64 references

Research works printed but not linked: 4

  1. singh, 2016, Novel hybrid image encryption (64-bit) based on Rubik cube and block cipher, Int J Comput Sci Inf Secur, 14, 184
  2. gueron, 2010, Advanced Encryption Standard (AES) Instructions Set
  3. shadangi, 2017, Novel Arnold scrambling based CBC-AES image encryption, J Control Theory Applied, 10, 93
  4. hemanth, 2015, Hybrid elliptic curve cryptography using ant colony based authentication system for cloud computing, J Eng Appl Sci, 10, 7273

Cited by

See all 7

Metadata

Authors
Silva-Garcia, V. M., Flores-Carapia, R., Gonzalez-Ramirez, M. D., Vega-Alvarado, E., & Villarreal-Cervantes, M. G.
Affiliations
Instituto Politécnico Nacional (MX)
Venue
IEEE Access
Published
2020
Volume
8
Pages
218777-218792
ISSN
2169-3536 (ISSN-L)
OpenAlex
W3111005456
Cited by
7
References
64
Citations by year
2024: 1 · 2023: 2 · 2022: 4
FWCI
0.58
Type
journal article
Language
en
Open access
Locations
  • IEEE Access (publishedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Greater South Information System
Funders
Instituto Politécnico Nacional of México
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
Keywords
image encryption, elliptic curve cryptography, symmetric ciphers, damage resistance, noise robustness, random permutations, median filter, similarity parameters, differential attack resistance, occlusion attack, Gaussian noise, additive noise

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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-09-30, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-09-30 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

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: Cryptosystem Based on the Elliptic Curve With a High Degree of Resistance to Damage on the Encrypted Images. https://app.cochat.ai/papers/10.1109/access.2020.3042475
The paper
Silva-Garcia, V. M., Flores-Carapia, R., Gonzalez-Ramirez, M. D., Vega-Alvarado, E., & Villarreal-Cervantes, M. G. (2020). Cryptosystem Based on the Elliptic Curve With a High Degree of Resistance to Damage on the Encrypted Images. IEEE Access. https://doi.org/10.1109/access.2020.3042475

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.