A substitution box generator, its analysis, and applications in image encryption

Azam, Naveed Ahmed; Hayat, Umar; Ayub, Maria

doi:10.1016/j.sigpro.2021.108144

Cited by 45 publications

(30 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It shows that although our lossy compression algorithm using compressed sensing can not fully restore the original image from the cipher image, it can obtain more secure cipher images than the lossless compression algorithm. What is more, it can be seen that the cipher images generated from our encryption scheme have greater information entropies than those of schemes based on substitution box [14] and quantum key image [28] in most instances, which means our scheme is more resistant to entropy attack than some encryption schemes based on non-chaotic techniques.…”

Section: Information Entropymentioning

confidence: 85%

“…Technology applied to image encryption includes chaotic systems [1][2][3][4][5][6][7][8], cellular automatons [9][10][11], substitution boxes [12][13][14], DNA encoding [15][16][17][18][19][20], elliptic curves [21][22][23][24], finite-precision error [25], Galois field [26] and quantum computing [27,28]. The chaotic system is most popular in the field of image encryption and is continuously improved, such as symmetric chaotic maps [29] and adaptive chaotic maps [30,31].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Image Encryption Scheme Based on Multiscale Block Compressed Sensing and Markov Model

Shi

Wang

2021

Entropy

View full text Add to dashboard Cite

Many image encryption schemes based on compressed sensing have the problem of poor quality of decrypted images. To deal with this problem, this paper develops an image encryption scheme by multiscale block compressed sensing. The image is decomposed by a three-level wavelet transform, and the sampling rates of coefficient matrices at all levels are calculated according to multiscale block compressed sensing theory and the given compression ratio. The first round of permutation is performed on the internal elements of the coefficient matrices at all levels. Then the coefficient matrix is compressed and combined. The second round of permutation is performed on the combined matrix based on the state transition matrix. Independent diffusion and forward-backward diffusion between pixels are used to obtain the final cipher image. Different sampling rates are set by considering the difference of information between an image’s low- and high-frequency parts. So, the reconstruction quality of the decrypted image is better than that of other schemes, which set one sampling rate on an entire image. The proposed scheme takes full advantage of the randomness of the Markov model and shows an excellent encryption effect to resist various attacks.

show abstract

Section: Information Entropymentioning

confidence: 85%

Section: Introductionmentioning

confidence: 99%

Image Encryption Scheme Based on Multiscale Block Compressed Sensing and Markov Model

Shi

Wang

2021

Entropy

View full text Add to dashboard Cite

show abstract

“…As a nonlinear device, S-box can be applied to the original algorithm to solve its problem. The design of the S-box needs to satisfy cryptographic properties such as nonlinearity, strict avalanche criterion, algebraic immunity, differential uniformity, and correlation immunity [ 25 ]. The improvement is given below by taking the S-box as an example.…”

Section: Numerical Simulation Experimentsmentioning

confidence: 99%

“…The traditional text encryption algorithms such as DES and AES are not suitable for image encryption. In recent years, image encryption based on chaotic systems [ 1 , 2 , 3 , 4 , 5 , 6 , 7 ], cellular automata [ 8 , 9 , 10 , 11 , 12 ], DNA encoding [ 13 , 14 , 15 ], bit plane decomposition [ 16 , 17 , 18 , 19 , 20 , 21 ], and elliptic curve [ 22 , 23 , 24 , 25 , 26 ] is the mainstream of cryptography. Due to the significant properties of unpredictability, ergodicity and initial state sensitivity, the chaotic system becomes a good choice for encryption [ 27 ].…”

Section: Introductionmentioning

confidence: 99%

Security Analysis of the Image Encryption Algorithm Based on a Two-Dimensional Infinite Collapse Map

Shi

Wang

2022

Entropy

View full text Add to dashboard Cite

This paper analyzes the security of the image encryption algorithm based on a two-dimensional (2D) infinite collapse map. The encryption algorithm adopts a permutation–diffusion structure and can perform two or more rounds to achieve a higher level of security. By cryptanalysis, it is found that the original diffusion process can be split into a permutation–diffusion structure, which comes after the original permutation, so these two permutations can be merged into one. Then, some theorems about round-down operation are summarized, and the encryption and decryption equations in the diffusion process are deduced and simplified accordingly. Since the chaotic sequences used in encryption algorithm are independent of the plaintext and ciphertext, there are equivalent keys. The original encryption algorithm with single-round, two-round, and multi-round of permutation–diffusion processes is cracked, and the data complexity of the cryptanalysis attacks is analyzed. Numerical simulation is carried out by MATLAB, and the experimental results and theoretical analysis show the effectiveness of the cryptanalysis attacks. Finally, some suggestions for improvement are given to overcome the shortcomings of the original encryption algorithm.

show abstract

“…On the other hand, a substitution operation substitutes plaintext bits or bytes with other bits or bytes which are not part of the plaintext [6]. Most eminent block ciphers employ one or more substitution boxes (S-boxes) that provide assistance in the substitution or replacement process [7][8][9]. An S-box is a substantial component of contemporary block ciphers and contributes much in the cohort of meaninglessness in the original data (plaintext).…”

Section: Introductionmentioning

confidence: 99%

Efficient Dynamic S-Box Generation Using Linear Trigonometric Transformation for Security Applications

et al. 2021

View full text Add to dashboard Cite

Protection of data transmitted over the network from illegal access is one of the major challenges being posed by exponential growth of data in online digital communication. Modern cryptosystems assist in data sanctuary by utilizing substitution-boxes (S-boxes). This paper presents a modest and novel technique to erect dynamic and key dependent S-boxes with the help of a novel linear trigonometric transformation. A new optimization plan is also suggested to improvise the nonlinearity characteristic of the preliminary S-box generated through trigonometric transformation. The proposed technique has the competence to create significant quantity of cryptographic strong S-boxes with the help of projected scheme. A specimen S-box is procreated, and standard performance criteria is applied to appraise the cryptographic strength of the resultant S-box and other known S-boxes available in the literature. Comparative performance analyses validate the noteworthy contribution of the proposed scheme for the generation of dynamic and secure S-boxes. An image privacy preserving scheme based on the proposed Sbox is also suggested to validate the fact that it holds strong candidature for modern cryptosystems to protect multimedia data.

show abstract

A substitution box generator, its analysis, and applications in image encryption

Cited by 45 publications

References 31 publications

Image Encryption Scheme Based on Multiscale Block Compressed Sensing and Markov Model

Image Encryption Scheme Based on Multiscale Block Compressed Sensing and Markov Model

Security Analysis of the Image Encryption Algorithm Based on a Two-Dimensional Infinite Collapse Map

Efficient Dynamic S-Box Generation Using Linear Trigonometric Transformation for Security Applications

Contact Info

Product

Resources

About