Preferred Language
Articles
/
ijs-6284
Modified Blowfish Algorithm for Image Encryption using Multi Keys based on five Sboxes
...Show More Authors

In this paper, a new modification was proposed to enhance the security level in the Blowfish algorithm by increasing the difficulty of cracking the original message which will lead to be safe against unauthorized attack. This algorithm is a symmetric variable-length key, 64-bit block cipher and it is implemented using gray scale images of different sizes. Instead of using a single key in cipher operation, another key (KEY2) of one byte length was used in the proposed algorithm which has taken place in the Feistel function in the first round both in encryption and decryption processes. In addition, the proposed modified Blowfish algorithm uses five Sboxes instead of four; the additional key (KEY2) is selected randomly from additional Sbox5, the fifth Sbox is formed in GF(28) and it is variable to increase the complexity of the proposed algorithm. The obtained results were tested using many criteria: correlation criteria, number of pixels change rate (NPCR) and mean square error (MSE). These tested factors were approved by the output results which demonstrated that the correlation of image elements in the proposed algorithm was significantly reduced during the encryption operation. Also, the algorithm is very resistant to attempts of breaking the cryptographic key since two keys were used in the encryption/ decryption operations which lead to increase the complexity factor in the proposed algorithm.

View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu May 18 2023
Journal Name
Journal Of Engineering
A Modified Strength Pareto Evolutionary Algorithm 2 based Environmental /Economic Power Dispatch
...Show More Authors

A Strength Pareto Evolutionary Algorithm 2 (SPEA 2) approach for solving the multi-objective Environmental / Economic Power Dispatch (EEPD) problem is presented in this paper. In the past fuel cost consumption minimization was the aim (a single objective function) of economic power dispatch problem. Since the clean air act amendments have been applied to reduce SO2 and NOX emissions from power plants, the utilities change their strategies in order to reduce pollution and atmospheric emission as well, adding emission minimization as other objective function made economic power dispatch (EPD) a multi-objective problem having conflicting objectives. SPEA2 is the improved version of SPEA with better fitness assignment, density estimation, an

... Show More
View Publication Preview PDF
Crossref
Publication Date
Mon Oct 10 2016
Journal Name
Iraqi Journal Of Science
Satellite image classification using KL-transformation and modified vector quantization
...Show More Authors

In this work, satellite images classification for Al Chabaish marshes and the area surrounding district in (Dhi Qar) province for years 1990,2000 and 2015 using two software programming (MATLAB 7.11 and ERDAS imagine 2014) is presented. Proposed supervised classification method (Modified Vector Quantization) using MATLAB software and supervised classification method (Maximum likelihood Classifier) using ERDAS imagine have been used, in order to get most accurate results and compare these methods. The changes that taken place in year 2000 comparing with 1990 and in year 2015 comparing with 2000 are calculated. The results from classification indicated that water and vegetation are decreased, while barren land, alluvial soil and shallow water

... Show More
Publication Date
Tue Jan 04 2022
Journal Name
Iraqi Journal Of Science
Text Compression & Encryption Method Based on RNA and MTF
...Show More Authors

The sending of information at the present time requires the speed and providing protection for it. So compression of the data is used in order to provide speed and encryption is used in order to provide protection. In this paper a proposed method is presented in order to provide compression and security for the secret information before sending it. The proposed method based on especial keys with MTF transform method to provide compression and based on RNA coding with MTF encoding method to provide security. The proposed method based on multi secret keys. Every key is designed in an especial way. The main reason in designing these keys in special way is to protect these keys from the predication of the unauthorized users.

View Publication Preview PDF
Publication Date
Thu Feb 28 2019
Journal Name
Iraqi Journal Of Science
Key Generator to Encryption Images Based on Chaotic Maps
...Show More Authors

It is known that images differ from texts in many aspects, such as high repetition and correlation, local structure, capacitance characteristics and frequency. As a result, traditional encryption methods can not be applied to images. In this paper we present a method for designing a simple and efficient messy system using a difference in the output sequence. To meet the requirements of image encryption, we create a new coding system for linear and nonlinear structures based on the generation of a new key based on chaotic maps.

The design uses a kind of chaotic maps including the Chebyshev 1D map, depending on the parameters, for a good random appearance. The output is a test in several measurements, including the complexity of th

... Show More
View Publication Preview PDF
Publication Date
Tue Sep 29 2020
Journal Name
Iraqi Journal Of Science
A New Beta Chaotic Map with DNA Encoding for Color Image Encryption
...Show More Authors

Images hold important information, especially in military and commercial surveillance as well as in industrial inspection and communication. Therefore, the protection of the image from abuse, unauthorized access, and damage became a significant demand. This paper introduces a new Beta chaotic map for encrypting and confusing the color image with Deoxyribonucleic Acid (DNA) sequence. First, the DNA addition operation is used for diffusing each component of the plain image. Then, a new Beta chaotic map is used for shuffling the DNA color image. In addition, two chaotic maps, namely the proposed new Beta and Sine chaotic maps, are used for key generation. Finally, the DNA XOR operation is applied between the generated key and shuffled DNA i

... Show More
View Publication Preview PDF
Scopus (6)
Crossref (2)
Scopus Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Engineering And Technology Journal
Face Retrieval Using Image Moments and Genetic Algorithm
...Show More Authors

Publication Date
Thu Jul 01 2021
Journal Name
Journal Of Physics: Conference Series
Wireless Optimization Algorithm for Multi-floor AP deployment using binary particle swarm optimization (BPSO)
...Show More Authors
Abstract<p>Optimizing the Access Point (AP) deployment is of great importance in wireless applications owing the requirement to provide efficient and cost-effective communication. Highly targeted by many researchers and academic industries, Quality of Service (QOS) is an important primary parameter and objective in mind along with AP placement and overall publishing cost. This study proposes and investigates a multi-level optimization algorithm based on Binary Particle Swarm Optimization (BPSO). It aims to an optimal multi-floor AP placement with effective coverage that makes it more capable of supporting QOS and cost effectiveness. Five pairs (coverage, AP placement) of weights, signal threshol</p> ... Show More
View Publication
Scopus Crossref
Publication Date
Fri Sep 30 2022
Journal Name
Iraqi Journal Of Science
Distributed Multi-Ant Colony System Algorithm using Raspberry Pi Cluster for Travelling Salesman Problem
...Show More Authors

     The traveling salesman problem is addressed in this paper by introducing a distributed multi-ant colony algorithm that is implemented on a Raspberry Pi cluster. The implementation of a master and eight workers, each running on Raspberry Pi nodes, is the central component of this novel technique. Each worker is responsible for managing their own colony of ants, while the master coordinates communications among workers’ nodes and assesses the most optimal approach. To put the newly built cluster through its paces, several datasets of traveling salesman problem are used to test the created cluster. The findings of the experiment indicate that a single board computer cluster, which makes use of multi-ant colony algorithm, is a via

... Show More
View Publication Preview PDF
Scopus (2)
Crossref (2)
Scopus Crossref
Publication Date
Wed Jan 01 2020
Journal Name
Journal Of Southwest Jiaotong University
IMPROVED STRUCTURE OF DATA ENCRYPTION STANDARD ALGORITHM
...Show More Authors

The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key gene

... Show More
Publication Date
Fri Jul 01 2016
Journal Name
Journal Of Engineering
An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning
...Show More Authors

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

... Show More
View Publication Preview PDF