An Image Encryption Scheme Based on Block Scrambling, Modified Zigzag Transformation and Key Generation Using Enhanced Logistic—Tent Map

Ramasamy, Priya; Vidhyapriya, R.; Kadry, Seifedine; Damaševičius, Robertas; Blažauskas, Tomas

doi:10.3390/e21070656

Cited by 108 publications

(71 citation statements)

References 61 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Furthermore, if the encryption algorithm has a less sensitive key, then any insignificant change in the real secret key will also lead to proper decryption of the actual image. Thus, a secret key of algorithm may seem corrupted, and as a result, the real key space will be smaller than the theoretical one [45,46] . Therefore, in order to further analyze the key sensitivity of our algorithm, we performed another experiment over the fruit image, in the encryption and decryption steps, by altering only one bit in the actual key, as shown below: Key o is the actual key, while Key 1 and Key 2 have only a one-bit key difference from the left-most side and the right-most side of the bit, respectively.…”

Section: Key Space and Key Sensitivitymentioning

confidence: 99%

See 1 more Smart Citation

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Butt

Khan

et al. 2020

Entropy

View full text Add to dashboard Cite

Bit-level and pixel-level methods are two classifications for image encryption, which describe the smallest processing elements manipulated in diffusion and permutation respectively. Most pixel-level permutation methods merely alter the positions of pixels, resulting in similar histograms for the original and permuted images. Bit-level permutation methods, however, have the ability to change the histogram of the image, but are usually not preferred due to their time-consuming nature, which is owed to bit-level computation, unlike that of other permutation techniques. In this paper, we introduce a new image encryption algorithm which uses binary bit-plane scrambling and an SPD diffusion technique for the bit-planes of a plain image, based on a card game trick. Integer values of the hexadecimal key SHA-512 are also used, along with the adaptive block-based modular addition of pixels to encrypt the images. To prove the first-rate encryption performance of our proposed algorithm, security analyses are provided in this paper. Simulations and other results confirmed the robustness of the proposed image encryption algorithm against many well-known attacks; in particular, brute-force attacks, known/chosen plain text attacks, occlusion attacks, differential attacks, and gray value difference attacks, among others.

show abstract

Section: Key Space and Key Sensitivitymentioning

confidence: 99%

“…Likewise, by calculating the variances of the histograms, we assessed the consistency of the encrypted images. If the variance of an encrypted images is smaller, then the uniformity (and the security level) of the particular image encryption algorithm is greater [45,46].…”

Section: Histogram Analysismentioning

confidence: 99%

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Butt

Khan

et al. 2020

Entropy

View full text Add to dashboard Cite

show abstract

“…The table values in bold fonts clearly concludes that our 3C3R overall performing much better than Refs. [56,62,76,91]. Hence, our 3C3R assures better image security.…”

Section: Performance Comparisonmentioning

confidence: 93%

3C3R, an Image Encryption Algorithm Based on BBI, 2D-CA, and SM-DNA

Khan

Han

Mudassir

et al. 2019

Entropy

View full text Add to dashboard Cite

Color image encryption has enticed a lot of attention in recent years. Many authors proposed a chaotic system-based encryption algorithms for that purpose. However, due to the shortcomings of the low dimensional chaotic systems, similar rule structure for RGB channels, and the small keyspace, many of those were cryptanalyzed by chosen-plaintext or other well-known attacks. A Security vulnerability exists because of the same method being applied over the RGB channels. This paper aims to introduce a new three-channel three rules (3C3R) image encryption algorithm along with two novel mathematical models for DNA rule generator and bit inversion. A different rule structure was applied in the different RGB-channels. In the R-channel, a novel Block-based Bit Inversion (BBI) is introduced, in the G-channel Von-Neumann (VN) and Rotated Von-Neumann (RVN)- based 2D-cellular structure is applied. In the B-channel, a novel bidirectional State Machine-based DNA rule generator (SM-DNA) is introduced. Simulations and results show that the proposed 3C3R encryption algorithm is robust against all well-known attacks particularly for the known-plaintext attacks, statistical attacks, brute-force attacks, differential attacks, and occlusion attacks, etc. Also, unlike earlier encryption algorithms, the 3C3R has no security vulnerability.

show abstract

“…It is a statistical measure used to evaluate the level of similarity between two adjacent pixels in the image or between two pixels in the same location of the original and encrypted image [18]. Karl Pearson in 1895 defined the equation for calculating the correlation coefficient called r which it is most used in statistical security analysis.…”

Section: Correlation Coefficientsmentioning

confidence: 99%

A Modified on Twofish Algorithm Based on Cyclic Group and Irreducible Polynomial in Gf (28)

muhajer

Rahma²

2020

QJPS

View full text Add to dashboard Cite

In this article" , a new adjustment is made on Twofish algorithm based on using a new operation called cyclic group extended # (CGE#) operation for increasing the randomness of algorithm. This is a new operation works on 8-bits and using 30 tables constructed with cyclic group and multiplication in Galois Field (GF) (2 8 ). A new (CGE#) operation is used instead of (X-OR) operation in each round of Feistel of Twofish. This is done by using dual keys: one key is used for selecting one table among 30 tables, and the other key is used for: encryption and decryption. The proposed algorithms are evaluated by using many security metrics such as complexity, NIST, histogram and correlation coefficients. The modification has given good results in these metrics, and this leads to make the proposed algorithm much more robust against many the attacks.

show abstract

An Image Encryption Scheme Based on Block Scrambling, Modified Zigzag Transformation and Key Generation Using Enhanced Logistic—Tent Map

Cited by 108 publications

References 61 publications

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD

3C3R, an Image Encryption Algorithm Based on BBI, 2D-CA, and SM-DNA

A Modified on Twofish Algorithm Based on Cyclic Group and Irreducible Polynomial in Gf (28)

Contact Info

Product

Resources

About