Preferred Language
Articles
/
URb_kYwBVTCNdQwCl_2O
Hiding a Secret Message Encrypted by S-DES Algorithm
...Show More Authors

Nowadays, it is quite usual to transmit data through the internet, making safe online communication essential and transmitting data over internet channels requires maintaining its confidentiality and ensuring the integrity of the transmitted data from unauthorized individuals. The two most common techniques for supplying security are cryptography and steganography. Data is converted from a readable format into an unreadable one using cryptography. Steganography is the technique of hiding sensitive information in digital media including image, audio, and video. In our proposed system, both encryption and hiding techniques will be utilized. This study presents encryption using the S-DES algorithm, which generates a new key in each cycle to increases the complexity of the algorithm detection. An additional shared key between the sender and the receiver is added which is applied before starting the encryption process, that key must be hex-decimal in order to increase the level of security and give enough time to delay the guessing of the secret text by the attackers.  The secret message data is concealed using one of the two techniques: either least significant bit (3-LSB) steganography or hiding in green and blue bits. To expedite the concealment process, the cover image is enhanced by applying a median filter, the median filter removes noise from the image while preserving its details. Finally, comparing the results of the two methods to determine which is better for the cover image in terms of PSNR metrics and hiding process time.

Crossref
View Publication
Publication Date
Tue Sep 08 2020
Journal Name
Baghdad Science Journal
Hiding the Type of Skin Texture in Mice based on Fuzzy Clustering Technique
...Show More Authors

A substantial matter to confidential messages' interchange through the internet is transmission of information safely. For example, digital products' consumers and producers are keen for knowing those products are genuine and must be distinguished from worthless products. Encryption's science can be defined as the technique to embed the data in an images file, audio or videos in a style which should be met the safety requirements. Steganography is a portion of data concealment science that aiming to be reached a coveted security scale in the interchange of private not clear commercial and military data. This research offers a novel technique for steganography based on hiding data inside the clusters that resulted from fuzzy clustering. T

... Show More
View Publication Preview PDF
Scopus (5)
Scopus Clarivate Crossref
Publication Date
Wed Mar 31 2021
Journal Name
Integrative Systematics: Stuttgart Contributions To Natural History
A confirmed record of the European catfish Silurus glanis L., 1758 (Actinopterygii: Siluriformes: Siluridae) from the southern marshes of Iraq, with a new anatomical set of characters to separate S. glanis and S. triostegus
...Show More Authors

View Publication
Scopus (3)
Crossref (2)
Scopus Crossref
Publication Date
Tue Jul 19 2022
Journal Name
Handbook Of Moth-flame Optimization Algorithm
Moth-Flame Optimization Algorithm, Arithmetic Optimization Algorithm, Aquila Optimizer, Gray Wolf Optimizer, and Sine Cosine Algorithm
...Show More Authors

View Publication
Scopus (4)
Crossref (3)
Scopus Crossref
Publication Date
Sun May 28 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Science
On-Line Navigational Problem of a Mobile Robot Using Genetic Algorithm
...Show More Authors

Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Tue Oct 16 2018
Journal Name
Springer Science And Business Media Llc
MOGSABAT: a metaheuristic hybrid algorithm for solving multi-objective optimisation problems
...Show More Authors

Scopus (65)
Crossref (48)
Scopus Clarivate Crossref
Publication Date
Wed Oct 12 2022
Journal Name
Axioms
Razy: A String Matching Algorithm for Automatic Analysis of Pathological Reports
...Show More Authors

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable

... Show More
View Publication
Scopus (2)
Scopus Clarivate Crossref
Publication Date
Sun Dec 01 2019
Journal Name
Applied Soft Computing
A new evolutionary multi-objective community mining algorithm for signed networks
...Show More Authors

View Publication
Scopus (8)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sat Dec 01 2018
Journal Name
Al-khwarizmi Engineering Journal
Applying A* Path Planning Algorithm Based on Modified C-Space Analysis
...Show More Authors

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

... Show More
View Publication Preview PDF
Crossref (4)
Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Computer And Communications
Pathfinding in Strategy Games and Maze Solving Using A* Search Algorithm
...Show More Authors

View Publication
Crossref (21)
Crossref