在椭圆曲线密码系统的实现过程中,不可避免的要进行有限域上的乘法运算,它是有限域的关键运算之一,目前实现算法基本有4种:比特串行乘法器、并行乘法器、混合乘法器、KOA多项式乘法。本文通过分析和比较4种算法的优缺点,找出最适合椭圆曲线密码系统的模乘运算,最大限度提高ECC密码体制硬件实现的性能。 In the implementation process of elliptic curve cryptosystem, it is unavoidable to perform multiplication on finite field. It is one of the key operations in finite field. At present, there are four kinds of algorithm: bit serial multiplier, parallel multiplier, Mixed multipliers, KOA polynomial multiplication. In this paper, by analyzing and comparing the advantages and disadvantages of the four algorithms, we find out the modular multiplication which is most suitable for the elliptic curve cryptosystem, and maximize the hardware performance of the ECC cryptosystem.