Elliptic curve GF (p) point multiplier by dual arithmetic cores
Tao Wu · 2015
Elliptic curve point multiplication (ECPM) over prime fields has received much attention these years due to growing applications of public key cryptography. In this work we propose a parallel architecture to perform ECPM by Montgomery ladder algorithm. It consists of dual arithmetic cores carrying out pipelined modular multiplications, two-port block RAMs, the modular divider and the control unit. It can compute a 384-bit ECPM by 1.03 ms at 276 MHz in Xilinx Virtex-4 FPGA, costing 11883 slices, 26 DSPs, and 26 block RAMs(32×12).