一种基于复合域的ECC的快速乘法器

A Fast Multiplier for Elliptic Curve Cryptosystems over Composite Fields

基于有限域上椭圆曲线公开密匙协议的离散对数计算算法正日益成为热点,而有限域上的计算尤其是乘法计算极大地影响其加/解密速度。基于ECC中有限域乘法的重要性,该文给出了一种复合域GF((2m1)m2)上的快速乘法器。该乘法器采用并行计算和串行计算相结合的原则,增加少量硬件规模将一次有限域乘法的计算速度由原来的m=m2m1个时钟周期降低到m2个时钟周期,从而极大地提高了乘法器的计算速度。

It has become increasingly common to implement discrete-algorithm based public-key protocols on elliptic curves over finite fields.The operations,especially multiplication,over finite fields affect greatly the speed of encryption/decryption for ECC.For this reason the contribution describes a fast multiplier for Elliptic Curve Cryptosystems over fi-nite fields GF((2 m1 ) m2 ).This multiplier adopts mixed parallel-serial approaches.The number of clock cycles for one field multiplication can be reduced from former m=m 2 m 1 to current m 2 with less increase of hardware scales.