Fast Scalar Multiplication Implementation of Elliptic Curves over Finite Field GF(2~n)
Zheng Li · Jisuanji gongcheng · 2007
Elliptic curve cryptosystem(ECC) is a kind of public-key cryptosystem,and its speed lies on the speed of scalar multiplication arithmetic.It is very simple to implement scalar multiplication by hardware when normal basis is used to denote the elements of base finite field,but it is very wasteful when n is a big number.This paper,under the analysis of algorithms in different levels of ECC,designs a fast scalar multiplication implementation and interface associated with 8-CPU.The result of FPGA implemetation indicates that 14 544 logic elements is used,and the efficiency of scalar multiplication is 40.71 per second at the frequeny of 53.70MHz.