Abstract: This paper analysis the elliptic curves operation rules，presents a high speed serial-parallel elliptic curve multiplier for the Galois field GF(2^N) which based on optimal normal basis, compares the ECC chip speed and hardware resource consuming induced by the different Field partition. The proposed multiplier requires 183 clocks for point addition, 175 clocks for point doubling and 133 clocks for multiplicative inverse computing. The rate of point multiplication is about 981 per second after FPGA validation.