Elliptic curve cryptography (ECC) is an alternative to traditional public keyrncryptographic systems. Even though, RSA (Rivest-Shamir-Adleman) was the mostrnprominent cryptographic scheme, it is being replaced by ECC in many systems. This isrndue to the fact that ECC gives higher security with shorter bit length than RSA. InrnElliptic curve based algorithms elliptic curve point multiplication is the mostrncomputationally intensive operation. Therefore implementing point multiplication usingrnhardware makes ECC more attractive for high performance servers and small devices. Inrnthis thesis FPGA accelerator for point multiplication over GF (2163) is proposed. Werndesigned and synthesized the point accelerator using Xilinx XCV2000 FPGA. Binaryrnfield arithmetic units from which the point accelerator is built are also designed andrnsynthesized. Experimental results show that a single point multiplication executes inrn47μs. This is a 161 fold speed up over software implementation. And it is also better thanrnthe fastest hardware accelerator published in the literature