一种两路并行调度的点乘算法硬件实现

摘要

针对 GF（2m）域椭圆曲线点乘算法计算速度慢，硬件实现成本高的问题，提出一种改进的并行调度算法以及专用的硬件调度结构。通过合并点乘算法中底层模乘、模逆及模平方算法，降低底层运算单元硬件成本。同时对点乘算法进行模乘和模平方两路并行调度分解，以提高运算速度。并针对点乘调度算法的特点，设计专用的硬件调度结构，以减少调度复杂性。StratixIII 系列的 FPGA 原型实现结果表明，通过这些方式使点乘运算速度得到提高。%An improved parallel scheduling algorithm and specific hardware scheduling structure is presented in this paper for solving the problem of low speed and high hardware cost of point multiplication algorithm of elliptic curve over GF(2m).Merging the underlying modular multiplication, modular inversion and modular square algorithm is used to reduce the cost of hardware implementation. Then a parallel scheduling has been made to point multiplication algorithm with modular multiplication and modular square for increasing computing speed. Besides,specific hardware scheduling structure is designed to reduce the complexity according to the feature of point multiplication. The result shows that point multiplication module introduced by this paper has reached an excellent cost performance both on speed and hardware resources on FPGA of StratixIII series.