| Autor: |
Singh, Khoirom Motilal, Singh, Laiphrakpam Dolendro, Tuithung, Themrichon |
| Předmět: |
|
| Zdroj: |
Multimedia Tools & Applications; Jan2023, Vol. 82 Issue 1, p1149-1170, 22p |
| Abstrakt: |
Recently, an encryption scheme (Abdelfatah IEEE Access 8:3875–3890, 2020) based on chaotic and enhanced elliptic curve cryptography was proposed. The author uses a pixel grouping method as an essential stage for the entire encryption scheme. This Pixel grouping method is carried out so that the execution speed is enhanced. However, there exists a condition during the pixel grouping stage that makes the method futile while decrypting. Upon pixel grouping, if the large integer turns out to be equal or larger than the modulo prime parameter P of the elliptic curve, precise decrypted values cannot be obtained. In this paper, the flaw is avoided by using the inverse modulo operator if the large integer is greater than or equal to P. Experimental analysis to prove the conditions is shown in this paper. Moreover, a new method is added to circumvent such conditions. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink