Preferred Language
Articles
/
BRcoPo8BVTCNdQwCamXJ
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 generations. This means the key generation system generates two keys: one is simple, and the other one is encrypted by using an improved Caesar algorithm. The encryption algorithm in the first 8 round uses simple key 1, and from round 9 to round 16, the algorithm uses encrypted key 2. Using the improved structure of the Data Encryption Standard algorithm, the results of this paper increase Data Encryption Standard encryption security, performance, and complexity of search compared with standard Data Encryption Standard. This means the Differential cryptanalysis cannot be performed on the cipher-text.

Publication Date
Mon Oct 01 2012
Journal Name
Iraqi Journal Of Physics
Ab–Initio large unit cell calculations of the electronic structure of Si and Ge nanocrystals
...Show More Authors

Ab – initio restricted Hartree - Fock method within the framework of large unit cell (LUC) formalism is used to investigate the electronic structure of Si and Ge nanocrystals. The surface and core properties are investigated. A large unit cell of 8 atoms is used in the present analysis. Cohesive energy, energy gap, conduction and valence band widths are obtained from the electronic structure calculations. The results are compared with available experimental data and theoretical results of other investigators. The calculated lattice constant is found to be slightly larger than the corresponding experimental value because we use only 8 atoms and we compared the results with that of the bulk crystals, nanoclusters are expected to have str

... Show More
View Publication Preview PDF
Publication Date
Thu Jan 01 2009
Journal Name
Bulletin Of Voronezh State University. The Series "linguistics And Intercultural Communication"
The word-formation structure of zoocomposites with a verb base in various types of languages
...Show More Authors

View Publication
Publication Date
Tue Sep 08 2020
Journal Name
Baghdad Science Journal
CTJ: Input-Output Based Relation Combinatorial Testing Strategy Using Jaya Algorithm
...Show More Authors

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing appli

... Show More
View Publication Preview PDF
Scopus (13)
Crossref (7)
Scopus Clarivate Crossref
Publication Date
Wed Mar 16 2022
Journal Name
2022 Muthanna International Conference On Engineering Science And Technology (micest)
A hybrid feature selection technique using chi-square with genetic algorithm
...Show More Authors

View Publication
Scopus (2)
Crossref (2)
Scopus 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 (6)
Crossref
Publication Date
Thu Jan 20 2022
Journal Name
Webology
Red Monkey Optimization and Genetic Algorithm to Solving Berth Allocation Problems
...Show More Authors

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Tue Sep 08 2020
Journal Name
Baghdad Science Journal
CTJ: Input-Output Based Relation Combinatorial Testing Strategy Using Jaya Algorithm
...Show More Authors

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing

... Show More
View Publication
Publication Date
Tue Sep 23 2025
Journal Name
Journal Of Plant Protection Research
Smart sprayer for weed control using an object detection algorithm (yolov5)
...Show More Authors

Spraying pesticides is one of the most common procedures that is conducted to control pests. However, excessive use of these chemicals inversely affects the surrounding environments including the soil, plants, animals, and the operator itself. Therefore, researchers have been encouraged to...

View Publication
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Mon Nov 10 2025
Journal Name
2025 18th International Conference On Development In Esystem Engineering (dese)
Arrhythmia Recognition Algorithm Using Squared Krawtchouk-Tchebichef Polynomial-Based Feature Extraction
...Show More Authors

View Publication
Scopus Crossref
Publication Date
Tue Aug 27 2024
Journal Name
Algorithms
Multithreading-Based Algorithm for High-Performance Tchebichef Polynomials with Higher Orders
...Show More Authors

Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us

... Show More
View Publication
Scopus (3)
Crossref (3)
Scopus Crossref