GF（2^m）域椭圆曲线点乘算法安全FPGA设计与实现

FPGA design and implementation of secure elliptic curve point multiplication algorithm over GF（2^m）

点乘算法是椭圆曲线密码体制中决定速度和硬件资源的关键部分。在深入分析混合结构乘法器并在FPGA上实现经典椭圆曲线点乘算法基础上,设计与实现了一种基于NAF编码混合结构乘法器思想的椭圆曲线点乘算法。对实现的点乘算法进行仿真测试和性能评估表明,新设计实现的基于混合结构乘法器的点乘算法在计算速度和资源使用上具有明显优势。

The point multiplication algorithm is a crucial segment of Elliptic Curve Cryptosystem（ECC） to determine its speed and hardware resources. We have designed and implemented a new point multiplication algorithm with NAF encoding method based on hybrid structure multipliers on the bas is of in-depth analysis of the hybrid structure multipliers and classic point muhiplication algorithms implementation on FPGA. We make some concerned experimental simulations about the three algorithms. The simulation and synthesis results show that the new designed point multiplication algorithm has some obvious advantages in the computing speed and hardware resources.