A Fast Multiplier Design and Implication over Finite Fields

It has become increasingly common to implement a discrete algorithm based on public key protocols on elliptic curves over finite fields The operations, especially multiplication, over finite fields affect greatly the speed of encryption/decryption for ECC To provide a higher computation speed in elliptic curve cryptosystems, many aspects should be considered, among which the key point is to enhance multiplier’s speed and to keep its area in proper range For this reason a fast multiplier is described for elliptic curve cryptosystems over finite composite fields GF（（2 m 1 ） m 2 ） This multiplier adopts mixed parallel serial approaches The number of clock cycles for one field multiplication can be reduced from the former m=m 2m 1 to the current m 2 with less increase of hardware scales This implementation is provided by FPGA testing to suit ECC