一种基于FPGA的素域椭圆曲线标量乘结构

A scalar multiplication structure for elliptic curve over prime fields and its FPGA implementation

基于一种简化求商的高基Montgomery模乘流水化阵列结构,提出并实现了素域上椭圆曲线标量乘硬件结构。该结构采用修正的Jacobian坐标的点加和倍点算法以及Kaliski提出的Montgomery模逆的算法。实验结果表明,该结构与相关工作相比具有更好的性能。

Based on a pipelined linear array for high radix Montgomery modular multiplication simplifying quotient determination, a scalar multiplication structure for elliptic curve over prime fields is proposed and implemented. The proposal uses the modified Jacobian projective coordinates to exploit the point addition and point doubling of elliptic curves, and adopts the Montgomery inverse algorithm proposed by Kaliski. Experimental results show that our structure can achieve better performance than the related work.