Abstract

We have proposed a robust, secure and efficient image encryption algorithm based on chaotic maps and algebraic structure. Nowadays, the chaotic cryptosystems gained more attention due to their efficiency, the assurance of robustness and high sensitivity corresponding to initial conditions. In literature, there are many encryption algorithms that can simply guarantees security while the schemes based on chaotic systems only promises the uncertainty, both of them can not encounter the needs of current scenario. To tackle this issue, this article proposed an image encryption algorithm based on Lorenz chaotic system and primitive irreducible polynomial substitution box. First, we have proposed 16 different S-boxes based on projective general linear group and 16 primitive irreducible polynomials of Galois field of order 256, and then utilized these S-boxes with combination of chaotic map in image encryption scheme. Three chaotic sequences can be produced by the disturbed of Lorenz chaotic system corresponding to variables x, y and z. We have constructed a new pseudo random chaotic sequence ki based on x, y and z. The plain image is encrypted by the use of chaotic sequence ki and XOR operation to get a ciphered image. To show the strength of presented image encryption, some renowned analyses are performed.

Highlights

  • Substitution box (S-box) is one of the fundamental constitute of symmetric key algorithms which implement substitution

  • We have proposed an image encryption algorithm that is based on chaotic maps and S-boxes

  • To find the S-box with fitting confusion creating strength many standard evaluating analysis are presented in literature such as Non-linearity, Bit independent criterion (BIC), Strict avalanche criterion (SAC), Linear approximation probability (LP) and Differential approximation probability (DP)

Read more

Summary

Introduction

Substitution box (S-box) is one of the fundamental constitute of symmetric key algorithms which implement substitution. The substitution tables (S-boxes) play a vital role in the encryption algorithms in order to meet the definition of a perfect security. There are many chaotic schemes that are using one or multiple (S-boxes) to get more security, there is no doubt that when one will use S-box the confusion creating ability of that algorithm between ciphertext and secret key will improve but it will definitely slow down the speed of encryption [6, 9, 10, 13, 18, 23, 24, 27, 29, 33,34,35,36, 39,40,41]. We have proposed an image encryption algorithm that is based on chaotic maps and S-boxes. The proposed work is to construct a secure and efficient image encryption scheme based on straightforward and little complex steps, by chaotic Lorenz system

Related work
Basic definitions
Galois field and its primitive irreducible polynomials
Chaotic Lorenz system
Primitive irreducible polynomial S-boxes
Analysis for evaluating the strength of S-box
XOR table and differential invariant
Proposed algorithm for image encryption cryptosystem
Least Significant
Statistical analysis
Correlation
Entropy
Contrast
Energy
Security analysis
Key space and key sensitivity
Avalanche analysis
Noise resistant analysis
Linear cryptanalysis
Differential cryptanalysis
Computational time
Methods
Findings
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call