This thesis presents a new two architecture for multiplication and inverse over GF(2^163) based on standard basis. A straight LUT-based multiplication requires memory of size for the Galois field of order 163 which is quite large for the fields by the National Institute of Standards and Technology (NIST). Therefore, one proposed a restriction the digit-size to 8 to design of multiplier that the result of the computing can be obtained only iterations 20 times operation, which is very much useful with respect to Network security issue that is needs high-speed applications. Moreover, this thesis is about improvement of inversion that is a part of ECC encryption system using the new proposed multiplier and factoring new method to improve the hardware architecture of inverse.