Data security is a significant requirement in our time. As a result of the rapid development of unsecured computer networks, the personal data should be protected from unauthorized persons and as a result of exposure AES algorithm is subjected to theoretical attacks such as linear attacks, differential attacks, and practical attacks such as brute force attack these types of attacks are mainly directed at the S-BOX and since the S-BOX table in the algorithm is static and no dynamic so this is a major weakness for the S-BOX table, the algorithm should be improved to be impervious to future dialects that attempt to analyse and break the algorithm  in order to remove these weakness points, Will be generated dynamic substitution box (S-B

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc

Symmetric cryptography forms the backbone of secure data communication and storage by relying on the strength and randomness of cryptographic keys. This increases complexity, enhances cryptographic systems' overall robustness, and is immune to various attacks. The present work proposes a hybrid model based on the Latin square matrix (LSM) and subtractive random number generator (SRNG) algorithms for producing random keys. The hybrid model enhances the security of the cipher key against different attacks and increases the degree of diffusion. Different key lengths can also be generated based on the algorithm without compromising security. It comprises two phases. The first phase generates a seed value that depends on producing a rand

When writing a text, such as a newspaper article, various types of discourse markers are frequently used to group sentences into paragraphs and parts in order to establish a discourse with certain functions, such as coordination, orientation, emphasizing the concepts presented, etc. It should also be noted that this type of mark exists in both written and spoken language. Therefore, it is convenient to dedicate a chapter to these linguistic elements to clarify their use and their classification, which is mainly based on Jose Portolés (2001), as well as the main features, specifically their features (prosodic, morphological, semantic and pragmatic).

Resumen

This research involved synthesis of new β-Lactam derivative from Azo compound[4-amino-N-(pyrimidine-2-yl)-3-(pyrimidine-2-yldiazenyl) benzene sulfonamide] (S1) record previously by many steps. Starting conversion the free amino group in an azo comp. to chloro acetamide derivative(S2), then reacted it with urea to give the oxazole ring  derivative (S3) that which containing free amino group. The condensation reaction between the amino group and P-bromobenzaldehyde to produce Shiff base (B14). Finally staudinger's cyclo addition reaction go run between the Shiff base derivative (B14) and chloro acetyl chloride in the presence of tri ethyl amine (Et₃N) as Base catalyst and dioxane a

Data-driven models perform poorly on part-of-speech tagging problems with the square Hmong language, a low-resource corpus. This paper designs a weight evaluation function to reduce the influence of unknown words. It proposes an improved harmony search algorithm utilizing the roulette and local evaluation strategies for handling the square Hmong part-of-speech tagging problem. The experiment shows that the average accuracy of the proposed model is 6%, 8% more than HMM and BiLSTM-CRF models, respectively. Meanwhile, the average F1 of the proposed model is also 6%, 3% more than HMM and BiLSTM-CRF models, respectively.

     Background subtraction is the dominant approach in the domain of moving object detection. Lots of research has been done to design or improve background subtraction models. However, there are a few well-known and state-of-the-art models that can be applied as a benchmark. Generally, these models are applied to different dataset benchmarks. Most of the time, choosing an appropriate dataset is challenging due to the lack of dataset availability and the tedious process of creating ground-truth frames for the sake of quantitative evaluation. Therefore, in this article, we collected local video scenes of a street and river taken by a stationary camera, focusing on dynamic background challenges. We presented a new technique for creati

A high settlement may take place in shallow footing when resting on liquefiable soil if subjected to earthquake loading. In this study, a series of shaking table tests were carried out for shallow footing resting on sand soil. The input motion is three earthquake loadings (0.05g, 0.1g, and 0.2g). The study includes a reviewing of theoretical equations (available in literatures), which estimating settlement of footings due to earthquake loading, calibration, and verification of these equations with data from the shaking table test for improved soil by grouting and unimproved soil. It is worthy to note that the grouting materials considered in this study are the Bentonite and CKD slurries. A modification to the seismic set

The growing use of tele

This paper presents a new secret diffusion scheme called Round Key Permutation (RKP) based on the nonlinear, dynamic and pseudorandom permutation for encrypting images by block, since images are considered particular data because of their size and their information, which are two-dimensional nature and characterized by high redundancy and strong correlation. Firstly, the permutation table is calculated according to the master key and sub-keys. Secondly, scrambling pixels for each block to be encrypted will be done according the permutation table. Thereafter the AES encryption algorithm is used in the proposed cryptosystem by replacing the linear permutation of ShiftRows step with the nonlinear and secret pe

Cipher security is becoming an important step when transmitting important information through networks. The algorithms of cryptography play major roles in providing security and avoiding hacker attacks. In this work two hybrid cryptosystems have been proposed, that combine a modification of the symmetric cryptosystem Playfair cipher called the modified Playfair cipher and two modifications of the asymmetric cryptosystem RSA called the square of RSA technique and the square RSA with Chinese remainder theorem technique. The proposed hybrid cryptosystems have two layers of encryption and decryption. In the first layer the plaintext is encrypted using modified Playfair to get the cipher text, this cipher text will be encrypted using squared