An Innovative Feasible Approach for Multi-Media Security Using Both Chaotic and Elliptic Curve Structures

Abstract

Researchers concentrate on data security using cryptography, using different approaches to protect confidential data, such as digital images holding private information. They use cryptography techniques, frequently using elliptic curves and chaotic structures for secure transmission. This paper introduces a novel technique for constructing S- boxes and their application in color image encryption. The utilization of discrete chaotic maps and elliptic curves results in low computational complexity, which is crucial for high-speed communication systems. The generation of S- boxes is based on elliptic curves over prime fields and discrete chaotic maps. The color image encryption scheme involves permutation, substitution, and bit-wise XOR operations of key with the color image’s corresponding substituted channels. The resistance of the newly constructed s-boxes against common attacks, such as linear, differential, and algebraic attacks, is analyzed by evaluating their non-linearity, linear approximation probability, differential approximation probability, bit avalanche criterion, and bit independence criterion. The encrypted images have strong resistance against statistical and differential attacks. Experimental results demonstrate that the newly constructed scheme can efficiently generate numerous distinct, uncorrelated, and secure S- boxes, outperforming some well-known existing techniques. The non-linearity of the proposed s-box is 107.5 and the entropy of the ciphered image of Baboon is 7.9989. The security analysis indicates that the color-encrypted image offers fast and higher protection against attacks, making it suitable for real-time applications with high security requirements.

Keywords

• Elliptic curve
• finite prime field
• image encryption
• logistic map
• prey-predator map
• S-box