Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex
... Show MoreThis study aimed to study the inhibition activity of purified bacteriocin produced from the local isolation Lactococcuslactis ssp. lactis against pathogenic bacteria species isolated from clinical samples in some hospitals Baghdad city. Screening of L. lactis ssp. Lactis and isolated from the intestines fish and raw milk was performed in well diffusion method. The results showed that L. lactis ssp. lactis (Lc4) was the most efficient isolate in producing the bacteriocin as well observed inhibitory activity the increased that companied with the concentration, the concentration of the twice filtrate was better in obtaining higher inhibition diameters compared to the one-fold concentration. The concentrate
... Show More