Performance Comparison of Finite Field Adders for SM2 Algorithm Based on FPGA Implementation

An Elliptic curve is one of the significant applications of cryptography, and the 256-bit of crypto that uses a digital signature algorithm based on such a method has the same security level as 3072-bit of RSA. In other words, the elliptic curve algorithm can reach the same security level using 12 times shorter bits than the RSA method. From the computational side, an efficient and high-speed calculation methodology is required in the field of 256 bits' finite field. The most required calculation in the finite field is the addition of arithmetic. This paper discusses our latest results on 256 bits' addition arithmetic implementations, which are implemented on the Virtex6 FPGA board and Xilinx 14.5 IDE. The considered simulation results include time delay propagation, area, and power consumption.