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

计算机工程 ›› 2007, Vol. 33 ›› Issue (09): 168-170.

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

GF(2n)域上基于ONB的ECC运算单元设计与实现

陈 韬,郁 滨   

  1. (解放军信息工程大学电子技术学院,郑州 450004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-05-05 发布日期:2007-05-05

Design and Implementation of ECC Algorithm Unit Based on ONB over GF(2n)

CHEN Tao, YU Bin   

  1. (Institute of Electronic Technology, PLA Information Engineering University, Zhengzhou 450004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-05-05 Published:2007-05-05

摘要: 分析了GF(2n)域上基于优化正规基(ONB)的椭圆曲线的运算法则,讨论了域划分对芯片实现速度和硬件资源占用二者的影响,设计了一种串-并行结构的基于ONB的高速有限域运算单元,用于完成GF(2191)域上基于ONB的ECC芯片实现,在50MHz时钟下,GF(2191)域上的点乘运算速度平均为981次/s。

关键词: 椭圆曲线, 优化正规基, 点乘运算, ECC

Abstract: Based on optimal normal basis in GF(2n), a high speed serial-parallel elliptic curve multiplier is proposed in the paper, through introduction of operation rules in GF(2n), elliptic curves and point operation rules, with emphasis on the discussion of the ECC chip speed and hardware resource consuming, which is induced by different field partitions. The rate of point multiply is about 981 per second after FPGA validation.

Key words: Elliptic curve, Optimal normal base, Point multiplication operation, ECC

中图分类号: