Multiplication over finite field is the most time consuming operation in implementing ECC, Actually multiplication over finite field is modular multiplication, The cryptographic processor performs multiplication over finite field GF(2~n) for ECC.

• 实现椭圆曲线密码系统最费时的就是有限域上的乘法,有限域上的乘法实际上是模乘,该协处理器能够为ECC处理有限域GF(2~n)上的乘法运算。