This paper presents a point multiplication processor over the binary field GF (2²³³) with internal registers integrated within the point-addition architecture to enhance the Performance Index (PI) of scalar multiplication. The proposed design uses one of two types of finite field multipliers, either the Montgomery multiplier or the interleaved multiplier supported by the additional layer of internal registers. Lopez Dahab coordinates are used for the computation of point multiplication on Koblitz Curve (K-233bit). In contrast, the metric used for comparison of the implementations of the design on different types of FPGA platforms is the Performance Index.

The first approach attains a performance index

In this study new derivatives of O-[2-{''2-Substituted Aryl (''1,''3,''4 thiadiazolyl) ['3,'4-b]-'1,'2,'4- Triazolyl]-Ethyl]-p- chlorobenzald oxime (6-11)have been synthesized from the starting material p-chloro – E- benzaldoxime 1.Compound 2 was synthesized by the reaction of p-chloro – E- benzaldoxime with ethyl acrylate in basic medium. Refluxing compound 2 with hydrazine hydrate in ethanol absolute afforded 3. Derivative 4 was prepared by the reaction of 3 with carbon disulphide, treated of compound 4 with hydrazine hydrate gave 5. The derivatives (6-11) were prepared by the reaction of 5 with different substitutesof aromatic acids. The structures of these compounds were characterized from their melting points, infrared spectroscopy

In this study new derivatives of O-[2-{''2-Substituted Aryl (''1,''3,''4 thia diazolyl) ['3,'4b]-'1,'2,'4- Triazolyl]-Ethyl]-p- chlorobenzald oxime (6-11) have been synthesized from the starting material p-chloro – E- benzaldoxime 1. Compound 2 was synthesized by the reaction of p-chloro – E- benzaldoxime with ethyl acrylate in basic medium. Refluxing compound 2 with hydrazine hydrate in ethanol absolute afforded 3. Derivative 4 was prepared by the reaction of 3 with carbon disulphide, treated of compound 4 with hydrazine hydrate gave 5. The derivatives (6-11) were prepared by the reaction of 5 with different substitutes of aromatic acids. The structures of these compounds were characterized from their melting points, infra

   This paper concerns with deriving and estimating the reliability of the multicomponent system in stress-strength model R_(s,k), when the stress and strength are identical independent distribution (iid), follows two parameters Exponentiated Pareto Distribution(EPD) with the unknown shape and known scale parameters. Shrinkage estimation method including Maximum likelihood estimator (MLE), has been considered. Comparisons among the proposed estimators were made depending on simulation based on mean squared error (MSE) criteria.

     A binary stream cipher cryptosystem can be used to encrypt/decrypt many types of digital files, especially those can be considered huge data files like images. To guarantee that the encryption or decryption processes need a reasonable time to encrypt/decrypt the images, so we have to make the stream cipher key generator that acts quickly without effect in the complexity or randomness of the output key binary sequences. In this paper, we increase the size of the output sequence from binary to digital sequence in the field  to obtain byte sequence, then we test this new sequence not only as binary but also -sequence. So we have to test the new output sequence in the new mathematical field. This is done by changing the base of the

A (b,t)-blocking set B in PG(2,q) is set of b points such that every line of PG(2,q) intersects B in at least t points and there is a line intersecting B in exactly t points. In this paper we construct a minimal (b,t)-blocking sets, t = 1,2,3,4,5 in PG(2,5) by using conics to obtain complete arcs and projective codes related with them.

   In this paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11),  n = 2,3,…,10,11  by geometric method, with the related blocking sets and projective codes.
 

A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.