Parallel AES Image Encryption with Logistic Map

The security of multimedia data, especially photographs, has grown in importance as digital communication has expanded quickly. The specialty area of information security known as "image cryptography" is concerned with securing image data using encryption methods to stop illegal access, alteration, or leaking. In contrast to text-based data, photos have a lot of information with strong pixel correlations and redundancy, which presents special potential and challenges for cryptographic applications. In this research, a logistic map-based chaotic system is combined with the Advanced Encryption Standard (AES) to provide a novel method for improving the security and efficiency of picture encryption. AES is implemented in parallel, enabling quicker encryption of high-resolution photos, and S-boxes and AES keys are dynamically generated using chaotic sequences drawn from the logistic map. It operates on blocks of the fixed size of 128 bits with a key size of 128, 192, or 128,192,256 bits and ten rounds are taken during the encryption and decryption processes. According to experimental results, the system is resilient to brute force and differential assaults, which makes it a viable option for the secure transmission of images in contemporary communication networks. The test results with a 32-byte key for the Flower image show that throughput, memory usage, speed-up, efficiency, and data processing factors are214.14550 MB/s, 185.09 MB, 0.82 s, 43.18 %, and 143186502.46 bytes/sec, respectively. The suggested approach performs better in terms of encrypted quality, random unpredictability, and processing when tested on both color and grayscale photos.