Efficient Finite Field Processor for GF(2^163) and its VLSI Implementation
Bijan Ansari, Huapeng Wu · 2007
A high performance finite field processor for elliptic curve cryptography is presented. One of the contributions in this work is the modified bit-parallel word-serial (BPWS) finite field multiplication algorithm and its corresponding pipeline-fashion multiplier architecture. The proposed multiplier achieves a throughput of one multiplication every N + 1 clock cycles, in contrast with at least N + 3 clock cycles required in the recent other designs, where N is the ratio of field size to word size. Another contribution of this work is to explore parallelism at the instruction level in the proposed processor. Separated hardware modules for finite field multiplication, squaring and addition make it possible that up to three finite field arithmetic operations be executed in parallel. At a higher level, data dependencies are detected at compile-time by analyzing the data interdependency when performing elliptic curve point operations. Implemented using a CMOS 0.18mum chip, which runs at 125MHz and performs one scalar multiplication in 62mus