In this paper a new technique based on dynamic stream cipher algorithm is introduced. The mathematical model of dynamic stream cipher algorithm is based on the idea of changing the structure of the combined Linear Feedback Shift Registers (LFSR's) with each change in basic and message keys to get more complicated encryption algorithm, and this is done by use a bank of LFSR's stored in protected file and we select a collection of LFSR's randomly that are used in algorithm to generate the encryption (decryption) key.

We implement Basic Efficient Criteria on the suggested Key Generator (KG) to test the output key results. The results of applying BEC prove the robustness and efficiency of the proposed stream cipher cryptosystem.

    In this paper , we study some approximation  properties of the strong difference and study the relation between the strong difference and the weighted modulus of continuity

Our goal from this work is to find the linear prediction of the sum of two Poisson process
) ( ) ( ) ( t Y t X t Z + = at the future time 0 ), ( ≥ + τ τ t Z and that is when we know the values of
) (t Z in the past time and the correlation function ) (τ βz

        The Rivest–Shamir–Adleman (RSA) and the Diffie-Hellman (DH) key exchange are famous methods for encryption. These methods  depended on selecting the primes p and q in order  to be secure enough . This paper shows that the named methods used the primes which are found by some arithmetical function .In the other sense, no need to think about getting primes p and q and how they are secure enough, since the arithmetical function enable to build the primes in such complicated way to be secure. Moreover, this article   gives  new construction  of the  RSA  algorithm and DH key  exchange using the

primes p,qfrom areal number x.

To decrease the dependency of producing high octane number gasoline on the catalytic processes in petroleum refineries and to increase the gasoline pool, the effect of adding a suggested formula of composite blending octane number enhancer to motor gasoline composed of a mixture of oxygenated materials (ethanol and ether) and aromatic materials (toluene and xylene) was investigated by design of experiments made by Mini Tab 15 statistical software. The original gasoline before addition of the octane number blending enhancer has a value of (79) research octane number (RON). The design of experiments which study the optimum volumetric percentages of the four variables, ethanol, toluene, and ether and xylene materials leads

Pandemic COVID-19 is a contagious disease affecting more than 200 countries, territories, and regions. Recently, Iraq is one of the countries that have immensely suffered from this outbreak. The Kurdistan Region of Iraq (KRI) is also prone to the disease. Until now, more than 23,000 confirmed cases have been recorded in the region. Since the onset of the COVID-19 in Wuhan, based on epidemiological modelling, researchers have used various models to predict the future of the epidemic and the time of peak, yielding diverse numbers in different countries. This study aims to estimate the basic reproductive number [R₀] for COVID-19 in KRI, using the standard SIR (Susceptible-Infected-Removed) epidemic model. A system of non

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.