Enhanced TEA Algorithm Performance using Affine Transformation and Chaotic Arnold Map

In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. The dual encryption process achieves high diffusion and confusion properties for the cipher process. The second approach proposed a chaotic Arnold map before the Tiny Encryption Algorithm (TEA) process. Various statistical measures are used, such as Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM), and Image Quality Index (IQI). For example, the lower PSNR, SSIM, and IQI values indicate better results for test image Lina of the second approach. The obtained results for the previous measures of the second approach are 8.5449, 0.0008, and -0.0061, compared to the first approach, 8.5529, 0.0054, -0.0015, respectively. Moreover, key space and time analysis are used to assess the encryption process. The outcomes show a high-key space 32,768*2128 ) and a slight encryption time of 130 milliseconds for the first approach and 1862 milliseconds for the second approach.

Authors

Institutions

Publication Details

Journal
Mesopotamian Journal of Computer Science
Published
2025-10-03
DOI
https://doi.org/10.58496/mjcsc/2025/022
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhanced TEA Algorithm Performance using Affine Transformation and Chaotic Arnold Map

Sura Abed Sarab Hussien, Nada Hussein M. Ali, Mays M. Hoobi
Mesopotamian Journal of Computer Science
Neural Networks and Applications
article

Enhanced TEA Algorithm Performance using Affine Transformation and Chaotic Arnold Map

Sura Abed Sarab Hussien, Nada Hussein M. Ali, Mays M. Hoobi
article en

Abstract

In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. The dual encryption process achieves high diffusion and confusion properties for the cipher process. The second approach proposed a chaotic Arnold map before the Tiny Encryption Algorithm (TEA) process. Various statistical measures are used, such as Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM), and Image Quality Index (IQI). For example, the lower PSNR, SSIM, and IQI values indicate better results for test image Lina of the second approach. The obtained results for the previous measures of the second approach are 8.5449, 0.0008, and -0.0061, compared to the first approach, 8.5529, 0.0054, -0.0015, respectively. Moreover, key space and time analysis are used to assess the encryption process. The outcomes show a high-key space 32,768*2128 ) and a slight encryption time of 130 milliseconds for the first approach and 1862 milliseconds for the second approach.

Mesopotamian Journal of Computer ScienceVol. 2025
University of Baghdad (IQ)
Openalex Percentile: Top 86%
Neural Networks and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.