基于FPGA的GF（2^m）域求逆算法的设计研究

Research on FPGA Implementation of Algorithm for Computing Inverse in GF（2^m）

有限域GF(2m)上的椭圆曲线密码体制以其密钥短、安全强度高的优点获得了广泛的重视和应用,该密码体制域运算中最费时的运算是有限域上的求逆运算。论文提出一种基于多项式基乘法和平方的FPGA快速求逆设计方法,并给出了面积与速度的比较分析。

The elliptic curve cryptosystems in the finite field GF（2^m） receive considerable attention and are widely used because of their small key size and high security,Inverse over the finite field GF（2^m） is the most time consumed arithmetic operation.This paper presents an efficient FPGA implementation for the algorithm for computing inverse based on polynomial basis multiplier and square,and the tradeoff analysis of the inverse with respect to area and performance is also provided.