摘要: 针对椭圆曲线密码体制中的有限域乘法运算,讨论基本的串行结构、并行结构以及串并混合结构乘法器的硬件实现及存在的缺陷,提出一种改进的乘法器结构。该结构利用分治算法,通过低位宽乘法运算级联,降低运算复杂度,减少所需的时钟数。FPGA实验结果证明新结构在相同频率下有更小的面积和时间乘积。GF(2233)域上椭圆曲线点乘采用此结构一次计算仅需0.811 ms,满足椭圆曲线密码体制的应用要求。
关键词:
乘法器,
椭圆曲线密码,
有限域
Abstract: This paper discusses the hardware implementation of basic serial multiplier, parallel multiplier and series-parallel multiplier in Elliptic Curve Cryptosystem(ECC) systems, and proposes an improved multiplier based on divided algorithm. By dividing data into several subsets and cascading small multipliers to a larger one, this divided algorithm reduces the total clock cycles needed. It only takes 0.811 ms for a scalar point multiplication over GF(2233), which meets the requirement of ECC.
Key words:
multiplier,
Elliptic Curve Cryptosystem(ECC),
finite field
中图分类号:
罗 鹏;许 应;封 君;王新安. 基于分治算法的ECC乘法器结构及实现[J]. 计算机工程, 2009, 35(13): 153-155.
LUO Peng; XU Ying; FENG Jun; WANG Xin-an. Architecture and Implementation of Multiplier Suitable for ECC Based on Divided Algorithm[J]. Computer Engineering, 2009, 35(13): 153-155.