High-speed and pipelined finite field bit-parallel multiplier over GF(2^m) for elliptic curve cryptosystems

This paper presents a high-speed and pipelined bit-parallel multiplier over binary finite fields for elliptic curve cryptosystems. The architecture of this multiplier is based on a parallel structure and multiplication by 2, so that the two inputs apply to the circuit simultaneously and in parallel form. Furthermore, the structure of the proposed circuit is reconfigurable to the change of the field size. Our implementation is in the gate level by high-speed and low-cost combinational logic circuits. The pipelining technique is applied to the proposed architecture to shorten the critical path delay and to conclude the computations in one clock cycle. The proposed architecture is efficient for FPGA and VLSI implementation. This work has been successfully verified and synthesized using Xilinx ISE 11 by Virtex-4, XC4VLX200 FPGA.