The principal goal guiding any designed encryption algorithm must be security against unauthorized attackers. Within the last decade, there has been a vast increase in the communication of digital computer data in both the private and public sectors. Much of this information has a significant value; therefore it does require the protection by design strength algorithm to cipher it. This algorithm defines the mathematical steps required to transform data into a cryptographic cipher and also to transform the cipher back to the original form. The Performance and security level is the main characteristics that differentiate one encryption algorithm from another. In this paper suggested a new technique to enhance the performance of the Data Encryption Standard (DES) algorithm by generate the key of this algorithm from random bitmaps images depending on the increasing of the randomness of the pixel colour, which lead to generate a (clipped) key has a very high randomness according to the know randomness tests and adds a new level of protection strength and more robustness against breaking methods.
Gypseous soils are considered one of the most problematic soils. The skirted foundation is an alternative technology that works to improve the bearing capacity and reduce settlement. This paper investigates the use of square skirted foundations resting on gypseous soil subjected to concentric and eccentric vertical load with eccentricity values of 4, 8, and 17 mm in 16 experimental model tests. To obtain the results by using this type of foundation, a small-scale physical model was designed to obtain the load–settlement behavior of the square skirted foundation; the dimension of the square footing is 100 mm × 100 mm with 1 mm thickness, the skirt depth (
This paper reports a numerical study of flow behaviors and natural convection heat transfer characteristics in an inclined open-ended square cavity filled with air. The cavity is formed by adiabatic top and bottom walls and partially heated vertical wall facing the opening. Governing equations in vorticity-stream function form are discretized via finite-difference method and are solved numerically by iterative successive under relaxation (SUR) technique. A computer program to solve mathematical model has been developed and written as a code for MATLAB software. Results in the form of streamlines, isotherms, and average Nusselt number, are obtained for a wide range of Rayleigh numbers 103-106 with Prandtl number 0.71
... Show MoreIn this paper, a least squares group finite element method for solving coupled Burgers' problem in 2-D is presented. A fully discrete formulation of least squares finite element method is analyzed, the backward-Euler scheme for the time variable is considered, the discretization with respect to space variable is applied as biquadratic quadrangular elements with nine nodes for each element. The continuity, ellipticity, stability condition and error estimate of least squares group finite element method are proved. The theoretical results show that the error estimate of this method is . The numerical results are compared with the exact solution and other available literature when the convection-dominated case to illustrate the effic
... Show MoreThis study aims to improve the quality of satellites signals in addition to increase accuracy level delivered from handheld GPS data by building up a program to read and decode data of handheld GPS. Where, the NMEA protocol file, which stands for the National Marine Electronics Association, was generated from handheld GPS receivers in real time using in-house design program. The NMEA protocol file provides ability to choose points positions with best status level of satellites such as number of visible satellite, satellite geometry, and GPS mode, which are defined as accuracy factors. In addition to fix signal quality, least squares technique was adopted in this study to minimize the residuals of GPS observations and enh
... Show MoreIn 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.
The efforts in designing and developing lightweight cryptography (LWC) started a decade ago. Many scholarly studies in literature report the enhancement of conventional cryptographic algorithms and the development of new algorithms. This significant number of studies resulted in the rise of many review studies on LWC in IoT. Due to the vast number of review studies on LWC in IoT, it is not known what the studies cover and how extensive the review studies are. Therefore, this article aimed to bridge the gap in the review studies by conducting a systematic scoping study. It analyzed the existing review articles on LWC in IoT to discover the extensiveness of the reviews and the topics covered. The results of the study suggested that many re
... Show MoreDue to the large-scale development in satellite and network communication technologies, there is a significant demand for preserving the secure storage and transmission of the data over the internet and shared network environments. New challenges appeared that are related to the protection of critical and sensitive data
from illegal usage and unauthorized access. In this paper, we address the issues described above and develop new techniques to eliminate the associated problems. To achieve this, we propose a design of a new sensor node for tracking the location of cars and collecting all information and all visited locations by cars, followed by
encryption in a sensor node and saving in the database. A microcontroller of Arduino es
In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la
In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la