A Lightweight Image Encryption Algorithm Based on Elliptic Curves and Chaotic In Parallel

Abstract

the use of lightweight encryption algorithms in a parallel environment helps to improve the performance and efficiency of the system that handles large-sized images. In a parallel environment the encryption and decryption images task is completed faster and with less strain on system resources. This is particularly useful for applications that require fast processing of large images, such as in websites or high-traffic applications. The main aim of this paper is offer a lightweight image coding technique that is implemented in a parallel pixel-level environment based on using chaotic sequences with curve points. The suggested system is built using highly parallel encryption and decryption operations. This results in the creation of a strong key value with a minimum bit length that may be used for lightweight encryption. By combining the Rubik's Cube and image density with elliptic curve cryptography (ECC), image colors are combined and distorted, and by using a Chaotic Logistics Map and Image Density with a secret key, Rubik's Cube is encrypted for the image, obtaining a secure image against attacks. The test results indicate that the highest value for PSNR, UACI, and NPCR are 8.3865, 34.4914, and 100, respectively. While encoding and decoding speeds reach 0.0062018 and 0.0069293 seconds, respectively.