Preferred Language
Articles
/
8oZ6T4YBIXToZYAL3oET
A Hybrid Modified Lightweight Algorithm Combined of Two Cryptography Algorithms PRESENT and Salsa20 Using Chaotic System
...Show More Authors

Cryptography algorithms play a critical role in information technology against various attacks witnessed in the digital era. Many studies and algorithms are done to achieve security issues for information systems. The high complexity of computational operations characterizes the traditional cryptography algorithms. On the other hand, lightweight algorithms are the way to solve most of the security issues that encounter applying traditional cryptography in constrained devices. However, a symmetric cipher is widely applied for ensuring the security of data communication in constraint devices. In this study, we proposed a hybrid algorithm based on two cryptography algorithms PRESENT and Salsa20. Also, a 2D logistic map of a chaotic system is applied to generate pseudo-random keys that produce more complexity for the proposed cipher algorithm. The goal of the proposed algorithm is to present a hybrid algorithm by enhancing the complexity of the current PRESENT algorithm while keeping the performance of computational operations as minimal. The proposed algorithm proved working efficiently with fast executed time, and the analyzed result of the generated sequence keys passed the randomness of the NIST suite.

Scopus Crossref
Publication Date
Wed Nov 28 2018
Journal Name
International Journal Of Engineering & Technology
Modified Strut Effectiveness Factor for FRP-Reinforced Concrete Deep Beams
...Show More Authors

A few examinations have endeavored to assess a definitive shear quality of a fiber fortified polymer (FRP)- strengthened solid shallow shafts. Be that as it may, need data announced for examining the solid profound pillars strengthened with FRP bars. The majority of these investigations don't think about the blend of the rigidity of both FRP support and cement. This examination builds up a basic swagger adequacy factor model to evaluate the referenced issue. Two sorts of disappointment modes; concrete part and pulverizing disappointment modes were examined. Protection from corner to corner part is chiefly given by the longitudinal FRP support, steel shear fortification, and cement rigidity. The proposed model has been confirmed util

... Show More
View Publication
Crossref (1)
Crossref
Publication Date
Fri Jan 01 2021
Journal Name
Handbook Of Polymer Nanocomposites For Industrial Applications
Polyaniline-graphite nanocomposite based modified cladding optical fiber gas sensors
...Show More Authors

View Publication
Scopus (1)
Scopus Crossref
Publication Date
Sat Nov 02 2019
Journal Name
Advances In Intelligent Systems And Computing
Modified Opposition Based Learning to Improve Harmony Search Variants Exploration
...Show More Authors

View Publication
Scopus (9)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sun Dec 07 2014
Journal Name
Baghdad Science Journal
The Modified Quadrature Method for solving Volterra Linear Integral Equations
...Show More Authors

In this paper the modified trapezoidal rule is presented for solving Volterra linear Integral Equations (V.I.E) of the second kind and we noticed that this procedure is effective in solving the equations. Two examples are given with their comparison tables to answer the validity of the procedure.

View Publication Preview PDF
Crossref
Publication Date
Fri Sep 03 2021
Journal Name
Entropy
Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials
...Show More Authors

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

... Show More
View Publication
Scopus (34)
Crossref (31)
Scopus Clarivate Crossref
Publication Date
Wed Sep 01 2021
Journal Name
Baghdad Science Journal
Optimum Median Filter Based on Crow Optimization Algorithm
...Show More Authors

          A novel median filter based on crow optimization algorithms (OMF) is suggested to reduce the random salt and pepper noise and improve the quality of the RGB-colored and gray images. The fundamental idea of the approach is that first, the crow optimization algorithm detects noise pixels, and that replacing them with an optimum median value depending on a criterion of maximization fitness function. Finally, the standard measure peak signal-to-noise ratio (PSNR), Structural Similarity, absolute square error and mean square error have been used to test the performance of suggested filters (original and improved median filter) used to removed noise from images. It achieves the simulation based on MATLAB R2019b and the resul

... Show More
View Publication Preview PDF
Scopus (8)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Sun Dec 01 2002
Journal Name
Iraqi Journal Of Physics
An edge detection algorithm matching visual contour perception
...Show More Authors

For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.

View Publication Preview PDF
Publication Date
Fri Apr 20 2012
Journal Name
International Journal Of Computer And Information Engineering
An Optimal Algorithm for HTML Page Building Process
...Show More Authors

An Optimal Algorithm for HTML Page Building Process

View Publication Preview PDF
Publication Date
Thu Dec 01 2011
Journal Name
2011 Developments In E-systems Engineering
Enhanced Computation Time for Fast Block Matching Algorithm
...Show More Authors

View Publication
Scopus (1)
Scopus Crossref
Publication Date
Thu Sep 26 2019
Journal Name
Processes
Fine-Tuning Meta-Heuristic Algorithm for Global Optimization
...Show More Authors

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

... Show More
View Publication Preview PDF
Scopus (26)
Crossref (23)
Scopus Clarivate Crossref