快速乘法器的设计与实现

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

The Design and Realization of the Rapid Multiplier

Implementing discrete-algorithm over finite fields, based on public-key protocols on elliptic curves, becomes increasingly common. The operations, especially multiplication, greatly affect the speed of encryption/decryption. This paper describes mixed parallel-serial approaches, which can be used for a fast multiplier for Elliptic Curve Cryptosystems over finite fields GF((2m1)m2). The number of clock cycles for one field multiplication can be reduced from former m= m2m1 to current m2 with less increase of hardware scales.