Cryptosystem Based on the Elliptic Curve With a High Degree of Resistance to Damage on the Encrypted Images
Open accessThe 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.
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
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
An Efficient Image Encryption Scheme Based on the LSS Chaotic Map and Single S-Box
Lu, Q., Zhu, C., & Deng, X. (2020) · IEEE Access · doi:10.1109/access.2020.2970806 · Cited by 281 · cited 1×
“It is important to consider the variance of the histogram of the ciphered image [50].”
BackgroundGallian, J. (2021) · Chapman & Hall/CRC eBooks · doi:10.1201/9781003142331 · Cited by 256
CacheBleed: a timing attack on OpenSSL constant-time RSA
Yarom, Y., Genkin, D., & Heninger, N. (2017) · Journal of Cryptographic Engineering · doi:10.1007/s13389-017-0152-y · Cited by 210 · cited 2×
“Since the prime number q used in this proposal is > 2 512 , it follows that the discrete logarithm problem is equivalent to factoring an integer n of size 2 15000 in an RSA scheme, which is much higher than the RSA version currently in use [10].”
BackgroundMethodColor image encryption based on chaotic systems and elliptic curve ElGamal scheme
Wu, J., Liao, X., & Yang, B. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.04.006 · Cited by 183
A novel image encryption scheme based on an elliptic curve
Hayat, U., & Azam, N. A. (2019) · Signal Processing · doi:10.1016/j.sigpro.2018.10.011 · Cited by 178 · cited 1×
“Because of the advanced development of the communication networks and the high quantity of valuable information that can be contained in an image, the image ciphering for protecting confidential data is a field with a highly dynamic development [1]–[6].”
BackgroundAn Image Encryption Method Based on Elliptic Curve Elgamal Encryption and Chaotic Systems
Luo, Y., Ouyang, X., Liu, J., & Cao, L. (2019) · IEEE Access · doi:10.1109/access.2019.2906052 · Cited by 172
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 · cited 2×
“In this sense, the number of keys in SCEC is considerably higher than in other proposals [26], [27].”
BackgroundResultAnalytical Study of Hybrid Techniques for Image Encryption and Decryption
Chowdhary, C. L., Patel, P. V., Kathrotia, K. J., Attique, M., Perumal, K., & Ijaz, M. F. (2020) · Sensors · doi:10.3390/s20185162 · Cited by 138 · cited 1×
“The entropy results generated by SCEC when applied to a series of well-known images surpassed the performance of other cryptosystems [30], [31].”
MethodA Blockchain-Based Secure Image Encryption Scheme for the Industrial Internet of Things
Khan, P. W., & Byun, Y. (2020) · Entropy · doi:10.3390/e22020175 · Cited by 137 · cited 1×
“Generally, the developments in cryptosystems do not consider any filter to improve the sharpness of the ciphered images that have been damaged [28], [29].”
BackgroundA Secure and Fast Image Encryption Scheme Based on Double Chaotic S-Boxes
Zhu, S., Wang, G., & Zhu, C. (2019) · Entropy · doi:10.3390/e21080790 · Cited by 131 · cited 1×
“Because of its implementation using Java-language threads, the execution time of SCEC is considerably lower than in other proposals [32]–[35].”
MethodS-Box Based Image Encryption Application Using a Chaotic System without Equilibrium
Wang, X., Çavuşoğlu, Ü., Kacar, S., Akgul, A., Pham, V.-T., Jafari, S., Alsaadi, F. E., & Nguyen, X. Q. (2019) · Applied Sciences · doi:10.3390/app9040781 · Cited by 125 · cited 1×
“Because of its implementation using Java-language threads, the execution time of SCEC is considerably lower than in other proposals [32]–[35].”
MethodA Novel Hybrid Secure Image Encryption Based on Julia Set of Fractals and 3D Lorenz Chaotic Map
Masood, F., Ahmad, J., Shah, S. A., Jamal, S. S., & Hussain, I. (2020) · Entropy · doi:10.3390/e22030274 · Cited by 125 · cited 1×
“The entropy results generated by SCEC when applied to a series of well-known images surpassed the performance of other cryptosystems [30], [31].”
MethodRecommendation for the Triple Data Encryption Algorithm (TDEA) Block Cipher | NIST
Barker, W. C., & Barker, E. B. (2012) · doi:10.1002/https://dx.doi.org/10.6028/nist.sp.800-67r2 · Cited by 119
A novel image encryption system merging fractional-order edge detection and generalized chaotic maps
Ismail, S. M., Said, L. A., Radwan, A. G., Madian, A. H., & Abu-ElYazeed, M. F. (2020) · Signal Processing · doi:10.1016/j.sigpro.2019.107280 · Cited by 115 · cited 1×
“These images are 512 × 512 pixels, and have been recurrently employed in previous works for their special characteristics [58].”
MethodSecure image encryption scheme using double random-phase encoding and compressed sensing
Zhou, K., Fan, J., Fan, H., & Li, M. (2020) · Optics & Laser Technology · doi:10.1016/j.optlastec.2019.105769 · Cited by 107 · cited 1×
“6% [46].”
Evolutionary-based image encryption using RNA codons truth table
Mahmud, M., Rahman, A., Lee, M., & Choi, J.-Y. (2019) · Optics & Laser Technology · doi:10.1016/j.optlastec.2019.105818 · Cited by 88 · cited 1×
“Most image encryption works carry out this analysis in three directions: horizontal, vertical and diagonal [44].”
BackgroundBinary search tree image encryption with DNA
Nematzadeh, H., Enayatifar, R., Yadollahi, M., Lee, M., & Jeong, G. (2020) · Optik · doi:10.1016/j.ijleo.2019.163505 · Cited by 79 · cited 1×
“In practical cases, entropy values close to 8 are desired for the primary color distributions of an encrypted figure [43].”
BackgroundZhu, S., & Zhu, C. (2019) · IEEE Access · doi:10.1109/access.2019.2946208 · Cited by 73 · cited 1×
“The correlation and entropy corresponding to some of the ciphered images also were calculated in [59], [60].”
MethodSecure Image Transmission Using Chaotic-Enhanced Elliptic Curve Cryptography
Abdelfatah, R. I. (2020) · IEEE Access · doi:10.1109/access.2019.2958336 · Cited by 73
A new image encryption algorithm with nonlinear-diffusion based on Multiple coupled map lattices
Wang, X., Zhao, H., & Wang, M. (2019) · Optics & Laser Technology · doi:10.1016/j.optlastec.2019.02.009 · Cited by 66
Washington, L. C. (2003) · doi:10.4324/9780203484029 · Cited by 66
A chaos based image encryption algorithm using Rubik’s cube and prime factorization process (CIERPF)
Vidhya, R., & Brindha, M. (2020) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2019.12.014 · Cited by 52 · cited 1×
“This tool aims to find out if the distributions of the primary colors fit to a uniform distribution [49].”
BackgroundAhmad, M., Al Solami, E., Wang, X.-Y., Doja, M. N., Beg, M. M. S., & Alzaidi, A. A. (2018) · Symmetry · doi:10.3390/sym10070266 · Cited by 50 · cited 1×
“Because of the characteristics of the Sha-512 function, every time an image is encrypted the keys are probably different; that is, the probability of collision is very low [33], [56].”
BackgroundA chaotic image encryption algorithm based on improved Joseph traversal and cyclic shift function
Wang, X., & Sun, H. (2020) · Optics & Laser Technology · doi:10.1016/j.optlastec.2019.105854 · Cited by 50 · cited 1×
“Additionally, the box must have a DPA 10, since the propose box must be resistant to the differential attack [54].”
BackgroundLiu, H., Zhao, B., & Huang, L. (2019) · IEEE Access · doi:10.1109/access.2019.2917498 · Cited by 48 · cited 2×
“(2) and a , b > 1 [14]. dP ( x ) dx = f ( x , P ( x )) (1) f ( x , P ( x )) = aP ( x ) − bP ( x ) 2 (2) An 8 × 8 S-box is a permutation of elements from an array of 256 numbers, in this case, the hex values from 00 h to FF h .”
BackgroundS-box, SET, Match: A Toolbox for S-box Analysis
Picek, S., Batina, L., Jakobović, D., Ege, B., & Golub, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43826-8_10 · Cited by 41
Zhang, X.-P., Guo, R., Chen, H.-W., Zhao, Z.-M., & Wang, J.-Y. (2018) · Chinese Physics B · doi:10.1088/1674-1056/27/8/080701 · Cited by 38
Comparison of Hash Function Algorithms Against Attacks: A Review
Maetouq, A., Mohd, S., Azurati, N., Maarop, N., Nur, N., & Abas, H. (2018) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2018.090813 · Cited by 37 · cited 1×
“Because of the characteristics of the Sha-512 function, every time an image is encrypted the keys are probably different; that is, the probability of collision is very low [33], [56].”
BackgroundShankar, K., Elhoseny, M., Perumal, E., Ilayaraja, M., & Kumar, K. S. (2019) · Advanced sciences and technologies for security applications · doi:10.1007/978-3-030-16837-7_3 · Cited by 36 · cited 1×
“INTRODUCTION Because of the advanced development of the communication networks and the high quantity of valuable information that can be contained in an image, the image ciphering for protecting confidential data is a field with a highly dynamic development [1]–[6].”
BackgroundRecommendation for the triple data encryption algorithm (TDEA) block cipher
Barker, W. C. (2004) · doi:10.6028/nist.sp.800-67v1 · Cited by 36
Improved Quantum Image Median Filtering in the Spatial Domain
Jiang, S.-X., Zhou, R., Hu, W., et al. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04103-w · Cited by 31 · cited 1×
“For evaluating the behavior of SCEC, a median filter of 3× 3 was applied to improve the sharpness of the decrypted images with damage [23].”
MethodSpeech Encryption Algorithm Based on Nonorthogonal Quantum State with Hyperchaotic Keystreams
Farsana, F. J., & Gopakumar, K. (2020) · Advances in Mathematical Physics · doi:10.1155/2020/8050934 · Cited by 28 · cited 1×
“In this sense, the number of keys in SCEC is considerably higher than in other proposals [26], [27].”
ResultShah, D., Shah, T., & Jamal, S. S. (2019) · Multidimensional Systems and Signal Processing · doi:10.1007/s11045-019-00689-w · Cited by 24 · cited 2×
“4%, and AC ≈ 50%, indicating the system robustness [48].”
BackgroundA Novel Method for Image Encryption Based on Chaos and Transcendental Numbers
Silva-García, V. M., Ramírez, M. D. G., Flores-Carapia, R., Vega-Alvarado, E., & Escobar, E. R. (2019) · IEEE Access · doi:10.1109/access.2019.2952030 · Cited by 24 · cited 1×
“(37), where NL i is obtained from the Walsh function [53], expressed in Eq.”
Self-citationA secure image encryption scheme with compression-confusion-diffusion structure
Zhu, S., Zhu, C., Fu, Y., Zhang, W., & Wu, X. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09699-4 · Cited by 19 · cited 1×
“The correlation and entropy corresponding to some of the ciphered images also were calculated in [59], [60].”
MethodCryptanalysis and improvement of blind signcryption scheme based on elliptic curve
Bashir, M. Z. U., & Ali, R. (2019) · Electronics Letters · doi:10.1049/el.2019.0032 · Cited by 17 · cited 1×
“Since SCEC is constructed using an elliptic curve, it is sensible to the attack of the discrete logarithm [7], [8].”
MethodPerformance analysis of transformation and Bogdonov chaotic substitution based image cryptosystem
Prajwalasimha, S. N., & Basavaraj, L. (2019) · International Journal of Electrical and Computer Engineering (IJECE) · doi:10.11591/ijece.v10i1.pp188-195 · Cited by 15 · cited 1×
“• Generally, the developments in cryptosystems do not consider any filter to improve the sharpness of the ciphered images that have been damaged [28], [29].”
BackgroundAn Improved AES S-box Based on Fibonacci Numbers and Prime Factor.
Mohamed, K., Ali, F. H. M., Ariffin, S. B., et al. (2018) · Cited by 9
Supercharacters, elliptic curves, and the sixth moment of Kloosterman sums
Garcia, S. R., & Todd, G. (2019) · Journal of Number Theory · doi:10.1016/j.jnt.2019.01.004 · Cited by 8 · cited 1×
“(7) states that the curve is not trace one, that is, the Fobenius trace must be different to one since the elliptic curves of trace one present a higher vulnerability [38].”
BackgroundAttack Experiments on Elliptic Curves of Prime and Binary Fields
Hla, N. N., & Aung, T. M. (2019) · Advances in Intelligent Systems and Computing · doi:10.1007/978-981-13-1951-8_60 · Cited by 6 · cited 2×
“Since SCEC is constructed using an elliptic curve, it is sensible to the attack of the discrete logarithm [7], [8].”
BackgroundMethodNew insights on linear cryptanalysis
Liu, Z., Han, S., Wang, Q., Li, W., Liu, Y., & Gu, D. (2020) · Science China Information Sciences · doi:10.1007/s11432-018-9758-4 · Cited by 6 · cited 1×
“The second point is related to the construction of an S-box that can resist the linear attack [12].”
BackgroundVilardy, J. M., Millán, M. S., & Pérez–Cabré, E. (2019) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/1221/1/012046 · Cited by 5 · cited 1×
“SCEC can stand a certain damage degree over the encrypted image produced by additive, multiplicative, Gaussian, or occlusion noise [20], in such a way that when deciphering the information, it is possible to distinguish at a glance the original image if it has been damaged [21].”
BackgroundA public key cryptosystem and signature scheme based on numerical series
Nagaty, K. A. (2020) · SN Applied Sciences · doi:10.1007/s42452-019-1928-8 · Cited by 5 · cited 1×
“Also, using the elliptic curve and the value of the Sha-512 function it is possible that the sender signs the information, applying the Elliptic Curve Signature Algorithm - ECSA [57].”
MethodIsolated elliptic curves and the MOV attack
Scholl, T. (2017) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2016-0053 · Cited by 4 · cited 1×
“(6) implies that the curve is non-supersingular, a condition required to prevent the MOV attack [37].”
BackgroundFixed points of rational functions satisfying the Carlitz property
Chubb, K., Panario, D., & Wang, Q. (2019) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-019-00382-2 · Cited by 4 · cited 1×
“The Euler criterion is used for finding out if k is a square power mod p of some element in the F p field [41].”
MethodThe cryptanalysis of the Rabin public key algorithm using the Fermat factorization method
Budiman, M. A., Rachmawati, D., & Utami, R. (2019) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/1235/1/012084 · Cited by 4 · cited 1×
“Using the little theorem of Fermat, it follows that ( z ) ( p − 1) ≡ 1 mod p [40], implying that k ( p − 1) / 4 mod p ≡ 1.”
MethodNew Results on Reversible Boolean Functions Having Component Functions with Specified Properties
Kerntopf, P., Podlaski, K., Moraga, C., & Stanković, R. S. (2019) · Springer eBooks · doi:10.1007/978-3-030-20323-8_10 · Cited by 3 · cited 1×
“An algorithm to produce permutations was developed, which defines a one-to-one function [15].”
MethodImage Encryption Using Fractional Order Linear-Nonlinear Chaos
Feng, G. (2020) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/1438/1/012010 · Cited by 3
Hardware‐Based Encryption via Generalized Synchronization of Complex Networks
Keuninckx, L., & der Sande, G. V. (2019) · Wiley eBooks · doi:10.1002/9781119527978.ch11 · Cited by 2 · cited 1×
“(29) [51].”
(2013) · Cited by 1
Highly nonlinear (vectorial) Boolean functions that are symmetric under some permutations
Kavut, S., & Tutdere, S. (2019) · Advances in Mathematics of Communications · doi:10.3934/amc.2020010 · Cited by 1 · cited 1×
“The Walsh function is used to calculate the nonlinearity of the S-box [16].”
MethodAttack Experiments on Elliptic Curves of Prime and Binary Fields
Hla, T. M. A. N. N. (2019) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.2482001
Cryptanalysis and improvement of an elliptic curve based signcryption scheme for firewalls
Zia, M., & Ali, R. (2018) · PLOS ONE · doi:10.1371/journal.pone.0208857
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 7
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
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.