With the wide developments of computer science and applications of networks, the security of information must be increased and make it more complex. The most important issues is how to control and prevent unauthorized access to secure information, therefore this paper presents a combination of two efficient encryption algorithms to satisfy the purpose of information security by adding a new level of encryption in Rijndael-AES algorithm. This paper presents a proposed Rijndael encryption and decryption process with NTRU algorithm, Rijndael algorithm is important because of its strong encryption. The proposed updates are represented by encryption and decryption Rijndael S-Box using NTRU algorithm. These modifications enhance the degree of
... Show MoreHighly-fluorescent Carbon Quantum Dots (CQDs) are synthesized in simple step by hydrothermal carbonization method of natural precursor such as orange juice as a carbon source. Hydrothermal method for synthesized CQDs requires simple and inexpensive equipment and raw materials, thus this method are now common synthesis method. The prepared CQDs have ultrafine size up to few nanometers and several features such as high solubility in water, low toxicity, high biocompatibility, photo-bleaching resistant, Chemical inertness and ease of functionalization which qualifies it for use in many applications such as bio-imaging, photo-labeling and photo-catalysis.
This research demonstrates the
... Show MoreIn this work, the linear properties of Vitamin D3-5000IU soft gel were investigated by measuring its absorption and fluorescence spectra. It was observed that there was a shift towards longer wavelength within limits (75 nm), with quantitative efficiency equal to (33.58%). The values of absorbance were used to calculate the extinction coefficient, optical refractive index, optical conductivity and optical dielectric constant values.
The non-linear properties of Vitamin D3-5000IU soft gel was also studied using the Z-Scan technique by using Neodymium-doped Yttrium Garnet (Nd: YAG) continuous laser (CW) emitting in &n
... Show MoreIn this work we investigate and calculate theoretically the variation in a number of optoelectronic properties of AlGaAs/GaAs quantum wire laser, with emphasis on the effect of wire radius on the confinement factor, density of states and gain factor have been calculated. It is found that there exist a critical wire radius (rc) under which the confinement of carriers are very weak. Whereas, above rc the confinement factor and hence the gain increase with increasing the wire radius.
This study includes the preparation of the ferrite nanoparticles CuxCe0.3-XNi0.7Fe2O4 (where: x = 0, 0.05, 0.1, 0.15, 0.2, 0.25, 0.3) using the sol-gel (auto combustion) method, and citric acid was used as a fuel for combustion. The results of the tests conducted by X-ray diffraction (XRD), emitting-field scanning electron microscopy (FE-SEM), energy-dispersive X-ray analyzer (EDX), and Vibration Sample Magnetic Device (VSM) showed that the compound has a face-centered cubic structure, and the lattice constant is increased with increasing Cu ion. On the other hand, the compound has apparent porosity and spherical particles, and t
... Show MoreEncryption of data is translating data to another shape or symbol which enables people only with an access to the secret key or a password that can read it. The data which are encrypted are generally referred to as cipher text, while data which are unencrypted are known plain text. Entropy can be used as a measure which gives the number of bits that are needed for coding the data of an image. As the values of pixel within an image are dispensed through further gray-levels, the entropy increases. The aim of this research is to compare between CAST-128 with proposed adaptive key and RSA encryption methods for video frames to determine the more accurate method with highest entropy. The first method is achieved by applying the "CAST-128" and
... Show MoreIn this paper we introduce two Algorithms, the first Algorithms when it is odd order and how we calculate magic square and rotation for it. The second Algorithms when it be even order and how to find magic square and rotation for it.
An experimental study is made here to investigate the discharge coefficient for contracted rectangular Sharp crested weirs. Three Models are used, each with different weir width to flume width ratios (0.333, 0.5, and 0.666). The experimental work is conducted in a standard flume with high-precision head and flow measuring devices. Results are used to find a dimensionless equation for the discharge coefficient variation with geometrical, flow, and fluid properties. These are the ratio of the total head to the weir height, the ratio of the contracted weir width to the flume width, the ratio of the total head to the contracted width, and Reynolds and Weber numbers. Results show that the relationship between the discharge co
... Show MoreIn many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an
... Show MoreLet be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of the minimum neighborhood dominating set of a graph is called as minimum neighborhood dominating number and it is denoted by . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the
... Show More