Large Field-Size Elliptic Curve Processor for Area-Constrained Applications

This article has proposed an efficient area-optimized elliptic curve cryptographic processor architecture over GF(2409) and GF(2571). The proposed architecture employs Lopez-Dahab projective point arithmetic operations. To do this, a hybrid Karatsuba multiplier of 4-split polynomials is proposed. The proposed multiplier uses general Karatsuba and traditional schoolbook multiplication approaches. Moreover, the multiplier resources are reused to implement the modular squares and addition chains of the Itoh-Tsujii algorithm for inverse computations. The reuse of resources reduces the overall area requirements. The implementation is performed in Verilog (HDL). The achieved results are provided on Xilinx Virtex 7 device. In addition, the performance of the proposed design is evaluated on ASIC 65 nm process technology. Consequently, a figure-of-merit is constructed to compare the FPGA and ASIC implementations. An exhaustive comparison to existing designs in the literature shows that the proposed architecture utilizes less area. Therefore, the proposed design is the right choice for area-constrained cryptographic applications.

Automated summary

This article presents an efficient area-optimized elliptic curve cryptographic processor architecture over GF(2409) and GF(2571) by employing Lopez-Dahab projective point arithmetic operations and a hybrid Karatsuba multiplier. The reuse of multiplier resources reduces overall area requirements. The implementation is performed in Verilog (HDL) and the achieved results are provided on Xilinx Virtex 7 device. The proposed design outperforms existing designs in terms of area utilization, making it the right choice for area-constrained cryptographic applications.