F2^n上基于ONB的椭圆曲线乘法器的设计与实现

The Design and Implementation of an Elliptic Curve Multiplier Based on ONB in F2^n

文章在介绍有限域运算法则,域上椭圆曲线及点的运算法则的基础上,设计了一个F1291上基于优化正规基的串行椭圆曲线乘法器,其点乘运算速度可达80.87次/秒,为进一步完成椭圆曲线加密系统提供了硬件基础。

A serial elliptic curve multiplier based on optimal normal basis in F2^n is carried out in the paper, through introduction of operation rules in Galois Field, elliptic curves and point operation rules. The rate of point multiply is about 80.87 per second. A well hardware basis for the completion of an elliptic curve cryptosystem is provided by the paper.