Extended of TEA: A 256 bits block cipher algorithm for image encryption

<p>This paper introduces an effective image encryption approach that merges a chaotic map and polynomial with a block cipher. According to this scheme, there are three levels of encryption. In the first level, pixel positions of the image are scuffled into blocks randomly based on a chaotic map. In the second level, the polynomials are constructed by taking N unused pixels from the permuted blocks as polynomial coefficients. Finally, the third level a proposed secret-key block cipher called extended of tiny encryption algorithm (ETEA) is used. The proposed ETEA algorithm increased the block size from 64-bit to 256-bit by using F-function in type three Feistel network design. The key schedule generation is very straightforward through admixture the entire major subjects in the identical manner for every round. The proposed ETEA algorithm is word-oriented, where wholly internal operations are executed on words of 32 bits. So, it is possible to efficiently implement the proposed algorithm on smart cards. The results of the experimental demonstration that the proposed encryption algorithm for all methods are efficient and have high security features through statistical analysis using histograms, correlation, entropy, randomness tests, and the avalanche effect.</p>

Download Full-text

A Novel Image Encryption Algorithm Based on DNA Subsequence Operation

The Scientific World JOURNAL ◽

10.1100/2012/286741 ◽

2012 ◽

Vol 2012 ◽

pp. 1-10 ◽

Cited By ~ 23

Author(s):

Qiang Zhang ◽

Xianglian Xue ◽

Xiaopeng Wei

Keyword(s):

Image Encryption ◽

Chaotic Map ◽

Security Analysis ◽

Experimental Results ◽

Encryption Algorithm ◽

Secret Key ◽

Logistic Chaotic Map ◽

Image Encryption Algorithm

We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack.

Download Full-text

Image Encryption Algorithm Based on Substitution Principle and Shuffling Scheme

Engineering and Technology Journal ◽

10.30684/etj.v38i3b.433 ◽

2020 ◽

Vol 38 (3B) ◽

pp. 98-103

Author(s):

Atyaf S. Hamad ◽

Alaa K. Farhan

Keyword(s):

Image Encryption ◽

Chaotic Map ◽

Logistic Map ◽

Encryption Algorithm ◽

Second Phase ◽

Cipher Text ◽

The Face ◽

Substitution Principle ◽

2D Logistic Map ◽

Image Encryption Algorithm

This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first phase because of including an S-box based on using substitution by AES algorithm in encryption and its inverse in Decryption. In the second phase, shifting and rotation were used based on secrete key in each channel depending on the result from the chaotic map, 2D logistic map and the output was processed and used for the encryption algorithm. It is known from earlier studies that simple encryption of images based on the scheme of shuffling is insecure in the face of chosen cipher text attacks. Later, an extended algorithm has been projected. This algorithm performs well against chosen cipher text attacks. In addition, the proposed approach was analyzed for NPCR, UACI (Unified Average Changing Intensity), and Entropy analysis for determining its strength.

Download Full-text

Non-Linear Hopped Chaos Parameters-Based Image Encryption Algorithm Using Histogram Equalization

Entropy ◽

10.3390/e23050535 ◽

2021 ◽

Vol 23 (5) ◽

pp. 535

Author(s):

Karim H. Moussa ◽

Ahmed I. El Naggary ◽

Heba G. Mohamed

Keyword(s):

Image Encryption ◽

Initial Conditions ◽

Signal To Noise Ratio ◽

Chaotic Map ◽

Histogram Equalization ◽

Encryption Algorithm ◽

Multimedia Contents ◽

Encryption Schemes ◽

Change Intensity ◽

Increasing Demand

Multimedia wireless communications have rapidly developed over the years. Accordingly, an increasing demand for more secured media transmission is required to protect multimedia contents. Image encryption schemes have been proposed over the years, but the most secure and reliable schemes are those based on chaotic maps, due to the intrinsic features in such kinds of multimedia contents regarding the pixels’ high correlation and data handling capabilities. The novel proposed encryption algorithm introduced in this article is based on a 3D hopping chaotic map instead of fixed chaotic logistic maps. The non-linearity behavior of the proposed algorithm, in terms of both position permutation and value transformation, results in a more secured encryption algorithm due to its non-convergence, non-periodicity, and sensitivity to the applied initial conditions. Several statistical and analytical tests such as entropy, correlation, key sensitivity, key space, peak signal-to-noise ratio, noise attacks, number of pixels changing rate (NPCR), unified average change intensity randomness (UACI), and others tests were applied to measure the strength of the proposed encryption scheme. The obtained results prove that the proposed scheme is very robust against different cryptography attacks compared to similar encryption schemes.

Download Full-text