Preferred Language
Articles
/
KPrYtZkBMF18lwyZ-M1A
Enhanced TEA Algorithm Performance using Affine Transformation and Chaotic Arnold Map
...Show More Authors

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. 

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Wed May 17 2023
Journal Name
Journal Of Engineering
Design of a Differential Chaotic on-off keying communication system
...Show More Authors

Among the available chaotic modulation schemes, differential chaos shift keying (DSCK) offers the perfect noise performance. The power consumption of DCSK is high since it sends chaotic signal in both of 1 and 0 transmission, so it does not represent the optimal choice for some applications like indoor wireless sensing where power consumption is a critical issue. In this paper a novel noncoherent chaotic communication scheme called differential chaos on-off keying (DCOOK) is proposed as a solution of this problem. With the proposed scheme, the DCOOK signal have a structure similar to chaos on-off keying (COOK) scheme with improved performance in noisy and multipath channels by introducing the concept of differential coherency used in DCS

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu May 05 2022
Journal Name
Periodicals Of Engineering And Natural Sciences (pen)
Classification SINGLE-LEAD ECG by using conventional neural network algorithm
...Show More Authors

View Publication
Scopus Crossref
Publication Date
Sat Nov 30 2019
Journal Name
Journal Of Engineering And Applied Sciences
Using Particle Swarm Optimization Algorithm to Address the Multicollinearity Problem
...Show More Authors

View Publication
Scopus (2)
Scopus Crossref
Publication Date
Mon May 01 2017
Journal Name
Australian Journal Of Basic And Applied Sciences
Sprite Region Allocation Using Fast Static Sprite Area Detection Algorithm
...Show More Authors

Background: Sprite coding is a very effective technique for clarifying the background video object. The sprite generation is an open issue because of the foreground objects which prevent the precision of camera motion estimation and blurs the created sprite. Objective: In this paper, a quick and basic static method for sprite area detection in video data is presented. Two statistical methods are applied; the mean and standard deviation of every pixel (over all group of video frame) to determine whether the pixel is a piece of the selected static sprite range or not. A binary map array is built for demonstrating the allocated sprite (as 1) while the non-sprite (as 0) pixels valued. Likewise, holes and gaps filling strategy was utilized to re

... Show More
View Publication Preview PDF
Publication Date
Tue Nov 17 2015
Journal Name
International Journal Of Computer Applications
Categorization of ‘Holy Quran-Tafseer’ using K-Nearest Neighbor Algorithm
...Show More Authors

View Publication
Crossref (1)
Crossref
Publication Date
Sun Apr 01 2018
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Information Hiding using LSB Technique based on Developed PSO Algorithm
...Show More Authors

<p>Generally, The sending process of secret information via the transmission channel or any carrier medium is not secured. For this reason, the techniques of information hiding are needed. Therefore, steganography must take place before transmission. To embed a secret message at optimal positions of the cover image under spatial domain, using the developed particle swarm optimization algorithm (Dev.-PSO) to do that purpose in this paper based on Least Significant Bits (LSB) using LSB substitution. The main aim of (Dev. -PSO) algorithm is determining an optimal paths to reach a required goals in the specified search space based on disposal of them, using (Dev.-PSO) algorithm produces the paths of a required goals with most effi

... Show More
View Publication
Scopus (19)
Crossref (7)
Scopus Crossref
Publication Date
Thu Jun 01 2023
Journal Name
Indonesian Journal Of Electrical Engineering And Computer Science
Image encryption based on combined between linear feedback shift registers and 3D chaotic maps
...Show More Authors

Protecting information sent through insecure internet channels is a significant challenge facing researchers. In this paper, we present a novel method for image data encryption that combines chaotic maps with linear feedback shift registers in two stages. In the first stage, the image is divided into two parts. Then, the locations of the pixels of each part are redistributed through the random numbers key, which is generated using linear feedback shift registers. The second stage includes segmenting the image into the three primary colors red, green, and blue (RGB); then, the data for each color is encrypted through one of three keys that are generated using three-dimensional chaotic maps. Many statistical tests (entropy, peak signa

... Show More
View Publication
Scopus (7)
Crossref (6)
Scopus Crossref
Publication Date
Tue Jun 01 2021
Journal Name
Bulletin Of Electrical Engineering And Informatics
A new pseudorandom bits generator based on a 2D-chaotic system and diffusion property
...Show More Authors

A remarkable correlation between chaotic systems and cryptography has been established with sensitivity to initial states, unpredictability, and complex behaviors. In one development, stages of a chaotic stream cipher are applied to a discrete chaotic dynamic system for the generation of pseudorandom bits. Some of these generators are based on 1D chaotic map and others on 2D ones. In the current study, a pseudorandom bit generator (PRBG) based on a new 2D chaotic logistic map is proposed that runs side-by-side and commences from random independent initial states. The structure of the proposed model consists of the three components of a mouse input device, the proposed 2D chaotic system, and an initial permutation (IP) table. Statist

... Show More
View Publication
Scopus (16)
Crossref (8)
Scopus Crossref
Publication Date
Sat Dec 31 2022
Journal Name
International Journal Of Intelligent Engineering And Systems
Using Three-Dimensional Logistic Equations and Glowworm Swarm Optimization Algorithm to Generate S-Box
...Show More Authors

View Publication
Scopus (4)
Crossref (1)
Scopus Crossref
Publication Date
Fri Jul 07 2017
Journal Name
International Journal Of Science And Research (ijsr)
Automatic brain tumor segmentation from MRI Images using superpixels based split and Merge algorithm
...Show More Authors

RA Ali, LK Abood, Int J Sci Res, 2017 - Cited by 2

View Publication