GF（2^m）域乘法器的快速设计及FPGA实现

Fast Design and FPGA Implementation of Multiplier in GF (2~m)

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

The elliptic curve cryptosystems in the finite field GF(2m)receive considerable attention and are widely used because of their small key size and high security.Multiplication over the finite field GF(2m)is the crucial arithmetic operation.This paper presents an efficient implementation for the polynomial basis multiplier based on FPGA technology,and the tradeoff analysis of the multipliers with respect to area and performance is also provided.