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 accessAbstract
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
Cites
Statistics
Verification
Claims the paper makes
5 Valid · 2 Not valid · 11 Not checked · 37 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“The entropy results generated by SCEC when applied to a series of well-known images surpassed the performance of other cryptosystems [30], [31].”
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > I. INTRODUCTION
What the sources say
- Partly supportedcites [30] 30. Khan, P.W.; Byun, Y. A Blockchain-Based Secure Image Encryption Scheme for the Industrial Internet of Things. Entropy 2020, 22, 175. sourceExperimental — accuracy not yet measured
Section 5.4 (Entropy Analysis; page unavailable) reports near-ideal entropy values for Lena and Cameraman and says it compares them with existing techniques. The passage does not identify the scheme as SCEC or establish that its entropy results surpassed other cryptosystems. (LLM, conf=0.82)
- Partly supportedcites [31] 31. Chowdhary, C.L.; Patel, P.V.; Kathrotia, K.J.; Attique, M.; Perumal, K.; Ijaz, M.F. Analytical Study of Hybrid Techniques for Image Encryption and Decryption. Sensors 2020, 20, 5162. sourceExperimental — accuracy not yet measured
Section 5.2 reports entropy measurements for the Eggs and Mona Lisa images, and the Conclusions state that the proposed hybrid algorithms achieved entropy values close to 8, better than existing algorithms. The paper evaluates ECC with Hill Cipher, ECC with AES, and ElGamal with Double Playfair Cipher—not SCEC—so it does not support attributing those results to SCEC. No page numbers were provided in our copy. (LLM, conf=0.85)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“In this sense, the number of keys in SCEC is considerably higher than in other proposals [26], [27].”
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > I. INTRODUCTION
What the sources say
- Not checked — no full text of the sourcecites [26] 26. Hua, Z., Zhou, Y. and Huang, H., 2019. Cosine-transform-based chaotic system for image encryption. Information Sciences, 480, pp.403-419.
- Supportedcites [27] 27. Z. Hua, B. Xu, F. Jin and H. Huang, Image Encryption Using Josephus Problem and Filtering Diffusion, in IEEE Access, vol. 7, pp. 8660-8674, 2019, doi: 10.1109/ACCESS.2018.2890116. source
The citation identifies a comparator proposal, not the source of SCEC’s own key count. The cited paper’s “Secret Key Analysis” section (page unavailable) states that its IES-JPFD proposal has a 256-bit key and a key space of 2^256, providing the comparator figure for the citing authors’ comparison. (LLM, conf=0.85)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The cited sources that could be checked couldn’t confirm or dispute this claim.
In the paper
“In this sense, to solve the discrete logarithm problem when the solution set of the elliptic curve has a prime factor of 2 256 , is equivalent to factoring n with a 2 3072 size [9].”
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > I. INTRODUCTION
What the sources say
- Could not verifycites [9] 9. Hemanth Chakravarthy M. and Kannan E. Hybrid Elliptic Curve Cryp- tography Using Ant Colony Based Authentication System for Cloud Computing, Journal of Engineering and applied Science, Vol. 10, (2015), pp: 7273-7279. sourceExperimental — accuracy not yet measured
Section 3.1 describes generating 256-element S-boxes from a chaotic system, and Section 3.2 evaluates their cryptographic properties. Searches for elliptic-curve discrete logarithms and the claimed 2^256-versus-2^3072 factoring equivalence found no passage addressing that comparison in our copy. (LLM, conf=0.77)
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Could not verify
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As can be seen, the time required by SCEC for this operation is considerably lower.”
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > This section begins with an analysis of the security in SCEC.
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The same situation occurred when encrypting completely white or black images.”
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > This section begins with an analysis of the security in SCEC.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
24 more claims
Create a free account to see all 55 claims and every source verdict.
- It may state two separate claims as one. 19
- Probably not a substantial claim. 8
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.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > This section begins with an analysis of the security in SCEC.
“On the other hand, the differential attack over SCEC cannot be performed because NPCR ≈ 99.96%, as well as UACI ≈ 33.4%, and AC ≈ 50%, indicating the system robustness [49].”
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > SCEC
“Table: 5 TABLE 5 : NPCR of the testing images after encryption | Color | Donkey | Cameraman | Jet | Lena | | --- | --- | --- | --- | --- | | Red | 99.617 | 99.615 | 99.612 | 99.616 | | Green | 99.601 | 99.608 | 99.600 | 99.617 | | Blue | 99.608 | 99.602 | 99.616 | 99.606 |”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > This section begins with an analysis of the security in SCEC.
“since q > 2 512 , it implies that the set of keys of SCEC is > 2 512 elements.”
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > C. S-BOX GENERATION WITH HIGH NONLINEARITY
“II) The Sha-512 function is applied to the 513 × 512 image to generate a 512-bit string.It is proposed that the integer associated with this string, K, be the encryption key.”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > This section begins with an analysis of the security in SCEC.
“the similarity parameter SP has at least a value of 78%, and in some cases it reached almost a 90% as indicated in Table 12.”
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > SCEC
“| Green | Additive | 77.12 | 91.16 | 88.93 | 89.55 | | | Multiplicative | 78.12 | 91.48 | 89.17 | 89.79 | | | Gaussian | 77.10 | 91.22 | 88.71 | 89.64 |”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > #E(F
“Additionally, the number of solutions is prime and is calculated according to Eq. (10).”
§ Cryptosystem based on the elliptic curve with a high degree of resistance to damage on the encrypted images > #E(F
“Thus, according to Theorem 1 the number of solutions is #E(F 38873 ) = 39268, and the prime q = 39268/4 = 9817.”
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry, and Engineering
Strogatz, S., Friedman, M., Mallinckrodt, A. J., & McKay, S. (1994) · Computers in Physics · doi:10.1063/1.4823332 · Cited by 4,648
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617 · cited 1×
“The Discrete Fourier Transform (DFT) is a test included in the NIST 800-22 standard, for measuring the randomness degree of a binary chain, that is, there are no repetitive zeros-and-ones patterns, one after another [45].”
MethodCosine-transform-based chaotic system for image encryption
Hua, Z., Zhou, Y., & Huang, H. (2019) · Information Sciences · doi:10.1016/j.ins.2018.12.048 · Cited by 776 · cited 1×
“If a communication scheme suffers an attack and the image gets damaged, the information could be unreadable depending on the damage extension and the applied cryptosystem [17].”
BackgroundElliptic curves: number theory and cryptography
(2004) · Choice Reviews Online · doi:10.5860/choice.41-4097 · Cited by 546
Cryptography in theory and practice
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_12 · Cited by 513
Fast image encryption algorithm based on parallel computing system
Wang, X., Feng, L., & Zhao, H. (2019) · Information Sciences · doi:10.1016/j.ins.2019.02.049 · Cited by 414 · cited 1×
“This programming scheme highly reduces the execution time of the tasks that can be parallelized [62], without requiring multiprocessor platforms.”
BackgroundA new hybrid digital chaotic system with applications in image encryption
Alawida, M., Samsudin, A., Teh, J. S., & Alkhawaldeh, R. S. (2019) · Signal Processing · doi:10.1016/j.sigpro.2019.02.016 · Cited by 401 · cited 1×
“The parameters Number-of-Pixels Change Rate (NPCR), Unified Average Changing Intensity (UACI) and Avalanche Criteria (AC) were applied to determine the resistance of SCEC to the differential attack [22].”
MethodSecure image encryption algorithm design using a novel chaos based S-box
Çavuşoğlu, Ü., Kaçar, S., Pehlivan, I., & Zengin, A. (2017) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2016.12.018 · Cited by 291
Research works printed but not linked: 4
- singh, 2016, Novel hybrid image encryption (64-bit) based on Rubik cube and block cipher, Int J Comput Sci Inf Secur, 14, 184
- gueron, 2010, Advanced Encryption Standard (AES) Instructions Set
- shadangi, 2017, Novel Arnold scrambling based CBC-AES image encryption, J Control Theory Applied, 10, 93
- hemanth, 2015, Hybrid elliptic curve cryptography using ant colony based authentication system for cloud computing, J Eng Appl Sci, 10, 7273
Cited by
A Novel Image Encryption Scheme Based on Elliptic Curves over Finite Rings
Hayat, U., Ullah, I., Azam, N. A., & Azhar, S. (2022) · Entropy · doi:10.3390/e24050571 · Cited by 43
“Furthermore, the UACI results of the new scheme for all the three components are better than the results of the schemes in [7,73,75,78] and comparable to that of the schemes in [28,29,74,76,77].”
InfluentialSilva-García, V. M., Flores-Carapia, R., Cardona-López, M. A., & Villarreal-Cervantes, M. G. (2023) · Mathematics · doi:10.3390/math11030599 · Cited by 6
Self-citationA Survey on Image and Text Encryption Using ECC and Steganography
Nafade, V. S., Patil, A. B., Khandelwal, Y. M., et al. (2023) · Algorithms for intelligent systems · doi:10.1007/978-981-99-3485-0_74 · Cited by 1
Image encryption based on chaos, elliptic curve, dynamic S-boxes and variable permutationsPreprint
Silva-García, V. M., Garcia-Cuahutle, K. B., Flores-Carapia, R., Gonzalez-Ramirez, M. D., & Chimal-Eguía, J. C. (2022) · Research Square · doi:10.21203/rs.3.rs-1647076/v1
Self-citationImage encryption based on chaos, elliptic curve, dynamic S-boxes and variable permutationsPreprint
Silva-García, V. M., Garcia-Cuahutle, K. B., Flores-Carapia, R., Ramírez, M. D. G., & Chimal-Eguía, J. C. (2022) · Research Square · doi:10.21203/rs.3.rs-1647076/v2 · Cited by 1
Self-citation
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)
- ORCID
- 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
- gold
- doi.org
- 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.