Quantum mechanics

Algorithm

Pixel

Discrete mathematics

Statistics

Computer security

Entropy (arrow of time)

Theoretical computer science

Encryption

Substitution (logic)

Operating system

Elliptic curve

Computer science

Acoustics

Elliptic curve cryptography

Geology

Public-key cryptography

Physics

Randomness

Mathematics

Image (mathematics)

Bijection

Mathematical analysis

Artificial intelligence

Programming language

Permutation (music)

Computer vision

IEEE Access

In this article, we present an encryption technique that can encrypt any digital data. The proposed scheme basically depends on a substitution-permutation network. Two separate bijective maps are used in the proposed algorithm. Firstly, the substitution boxes are used to perform the substitution process. This technique uses elliptic curves (ECs) to create several substitution boxes with good cryptographic properties. The generated substitution boxes are utilized to replace the arrange data that produces the most uncertainty in the plain image data. Further, we used the permutation process to generate strong randomness in the proposed technique. For the evaluation of the stability of the proposed algorithm; nonlinearity, linear approximation probability, bit independence criterion, strict avalanche criterion and differential approximation probability were performed on the substitution boxes. Differential attacks ( Number of Changing Pixel Rate (NPCR), Uniform Average Change Intensity (UACI)) and statistical tests ( Entropy, Correlation) were performed on the encrypted images to check their resistance against different attacks. The execution and image analysis reveals that the proposed scheme attains good encryption results while requiring minimal computing ability and has efficient potential in real-time image encryption applications.

Construction of S-Boxes Using Different Maps Over Elliptic Curves for Image Encryption