Dual Security RGB Image Encryption Algorithm for Lightweight Cryptography

An efficacious mathematical cryptographic algorithm for three-plane RGB images based on an L-shaped fractal and a 1-D chaotic tent map is proposed. Since vast data sets of images and videos are transmitted daily over public channels, the security and authenticity of data are of utmost priority. Fractals are very well suited for image encryption on a large scale due to their randomness property and infinite boundaries. One of the simplest implementations on the hardware of an IoT device is a one-dimensional dynamical system called the 1-D Chaotic tent map. This map is frequently used in encryption techniques because of its sensitivity towards initial conditions and impulsiveness. Due to the low dimensions of the 1-D chaotic tent map, this algorithm is more suited for lightweight cryptographic applications. The computer simulation results on MATLAB 2022a are explained to analyze the capabilities of the proposed algorithm using statistical analysis. The test results of differential attacks, percentage cropping attacks, and noise attacks are tabulated to confirm the wholesomeness of the proposed algorithm for 3-plane image encryption. There is a table that shows how secure the proposed 3-plane image encryption algorithm is by comparing it to other RGB image encryption algorithms that are already out there using entropy, correlation coefficient, and robustness using differential attacks.