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

The purpose of my thesis is to synthesis two new bidentate ligands ‎which were used to prepare series of metal complexes by reacting the ‎ligands with (M+2 = Mn, Co, Ni, Cu, Cd and Hg) ‎ ‎ Succinyl chloride was used as starting material to synthesis two ‎bidentate ligands (L1) and (L2) by reaction it with 4-chloroaniline ‎‎(L1) and ‎ ‎ (4-aminoacetophenone) (L2) in dichloromethane as a solvent, that ‎are:‎ ‎(L1) = N1,N4-bis (4-chloro phenyl ) succinamide ‎(L2) =N1,N4-bis(4-acetylphenyl)succinamide ‎ The new ligands were characterize by using spectroscopic study ‎‎(Fourier-transform infrared spectroscopy (FT-IR), electronic spectra ( ‎UV-Vis) ,nuclear magnetic resonance(1H,13C-NMR), Mass spectra ‎