作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (13): 153-155. doi: 10.3969/j.issn.1000-3428.2009.13.053

• 安全技术 • 上一篇    下一篇

基于分治算法的ECC乘法器结构及实现

罗 鹏,许 应,封 君,王新安   

  1. (北京大学深圳集成微系统重点实验室,深圳 518055)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-07-05 发布日期:2009-07-05

Architecture and Implementation of Multiplier Suitable for ECC Based on Divided Algorithm

LUO Peng, XU Ying, FENG Jun, WANG Xin-an   

  1. (Key Lab of Integrated Micro-system in Shenzhen, Peking University, Shenzhen 518055)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-07-05 Published:2009-07-05

摘要: 针对椭圆曲线密码体制中的有限域乘法运算,讨论基本的串行结构、并行结构以及串并混合结构乘法器的硬件实现及存在的缺陷,提出一种改进的乘法器结构。该结构利用分治算法,通过低位宽乘法运算级联,降低运算复杂度,减少所需的时钟数。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

中图分类号: