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

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...

Full description

Saved in:
Bibliographic Details
Published in:International journal of electrical and computer engineering (Malacca, Malacca) Vol. 11; no. 5; p. 3996
Main Authors: Shimal, Abeer F., Helal, Baydaa H., Hashim, Ashwaq T.
Format: Journal Article
Language:English
Published: Yogyakarta IAES Institute of Advanced Engineering and Science 01.10.2021
Subjects:
Algorithms
Chaos theory
Encryption
Histograms
Network design
Pixels
Polynomials
Smart cards
Statistical analysis
ISSN:2088-8708, 2722-2578, 2088-8708
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2088-8708
2722-2578
2088-8708
DOI:10.11591/ijece.v11i5.pp3996-4007