Optimized FPGA Implementation of Elliptic Curve Cryptosystem over Prime Fields

Elliptic curve cryptosystem has been widely applied in a lot of fields, such as finance, E-commerce and E-government. In this paper, we propose an optimized FPGA implementation of elliptic curve cryptosystem over 256-bit prime fields, which has high computational performance and low resource consumption. Specifically, we design a novel modular multiplier supporting four-level pipelining, which only needs 7 clock cycles to complete a single modular multiplication. It can process 4 modular multiplication operations (4 MMPO) simultaneously. We further design, on the basis of 4MMPO, a parallel architecture to efficiently implement point doubling and point addition operation. Finally, we testify the validity of our ECC processor on Xilinx's Virtex-7 FPGA platform. The result shows that it takes only 0.15ms for an elliptic curve point multiplication, the maximum frequency of the processor is about 123.27Mhz and the resource only needs 22938 look-up tables (LUTs).