Abstract
In this manuscript, we propose an image encryption technique by using isomorphic elliptic curves which are proved to be effective against side-channel attacks and have efficient key size as compared to other public-key structures. The proposed technique counts on the Kobltiz method to convert plain images into elliptic curve points. These points are then mapped to the isomorphic curve and are the reason for diffusion in the ciphertext. Besides this diffusion mechanism, elliptic curve points are also involved in the construction of small substitution boxes for confusion. This proposed confusion and diffusion technique also provides quality security in response to well-known cryptographic attacks as established by the number of statistical results and security analysis.
Highlights
In the last few decades, the accelerated development of digital technology and network communications enhanced the transmission of electronic data through different networks
Advanced Encryption Standard (AES) [1], Data Encryption Standard (DES) [2], and triple data encryption standard (TDES) [3] are the examples of symmetric key cryptography. The schemes such as AES and TDES are some of the efficient cryptographic algorithms and suitable for the security of small data; these schemes are incapable of securing multimedia data like digital images, audio, and video data
We study some of the quality research works related to elliptic curve cryptography
Summary
In the last few decades, the accelerated development of digital technology and network communications enhanced the transmission of electronic data through different networks. Researchers used different mathematical structures for the development of a secure image encryption scheme having minuscule computational complexity. For this reason, we study some of the quality research works related to elliptic curve cryptography. The authors introduced a novel methodology that mapped the pixels of the image into the set of elliptic curve points over the finite field GF(p). The authors constructed a mapping table, which has an index value in the range of 0 to 255 They considered the pixel positions (i, j) of the image as the elliptic curve points (xiyi), and encrypted the obtained points using the public key.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
