Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2007, Vol. 33 ›› Issue (24): 175-176. doi: 10.3969/j.issn.1000-3428.2007.24.061

• Security Technology • Previous Articles     Next Articles

Fast Scalar Multiplication Implementation of Elliptic Curves over Finite Field GF(2n)

YANG Xian-wen, LI Zheng   

  1. Institute of Electronic Technology, PLA Information Engineering University, Zhengzhou 450004

  • Received:1900-01-01 Revised:1900-01-01 Online:2007-12-20 Published:2007-12-20

基于GF(2n)上椭圆曲线标量乘的快速实现

杨先文,李 峥   

  1. 解放军信息工程大学电子技术学院,郑州 450004

Abstract: Elliptic curve cryptosystem(ECC) is a kind of public-key cryptosystem, and its speed lies on the speed of scalar multiplication arithmetic. It is very simple to implement scalar multiplication by hardware when normal basis is used to denote the elements of base finite field, but it is very wasteful when n is a big number. This paper, under the analysis of algorithms in different levels of ECC, designs a fast scalar multiplication implementation and interface associated with 8-CPU. The result of FPGA implemetation indicates that 14 544 logic elements is used, and the efficiency of scalar multiplication is 40.71 per second at the frequeny of 53.70MHz.

Key words: polynomial basic, elliptic curve, scalar multiplication

摘要: 椭圆曲线密码体制是一种基于代数曲线的公开密码体制,其曲线的标量乘速度决定了该密码体制的速度。正规基表示基域元素虽然利于硬件实现,但当n较大时会消耗大量的硬件资源。该文通过对椭圆曲线密码体制不同层次的算法进行分析,给出了具体的快速实现方案,并完成了与8位CPU的接口设计。FPGA实现结果表明,硬件消耗为14 544个逻辑单元,在频率为53.70 MHz时钟驱动下,运算速度为每秒40.71次。

关键词: 多项式基, 椭圆曲线, 标量乘法

CLC Number: