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 reaction oisolated and characterized by elemental analysis (C,H,N) , 1H-NMR, mass spectra and Fourier transform (Ft-IR). The reaction of the (L-AZD) with: [VO(II), Cr(III), Mn(II), Co(II), Ni(II), Cu(II), Zn(II), Cd(II) and Hg(II)], has been investigated and was isolated as tri nuclear cluster and characterized by: Ft-IR, U. v- Visible, electrical conductivity, magnetic susceptibilities at 25 Co, atomic absorption and molar ratio. Spectroscopic evidence showed that the binding of metal ions were through azide and carbonyl moieties resulting in a six- coordinating metal ions in [Cr (III), Mn (II), Co (II) and Ni (II)]. The Vo (II), Cu (II), Zn (II), Cd (II) and Hg (II) were coordinated through azide group only forming square pyramidal