期刊文献+

GF(2^m)域上ECC通用加速器设计与实现 被引量:2

Design and implementation of universal accelerator of ECC over GF (2^m)
下载PDF
导出
摘要 分析了GF(2m)域上基于多项式基(PB)的椭圆曲线的运算法则,针对不同不可约多项式广泛应用的现状,提出了GF(2m)(160≤≤400)上通用加速器设计方案并对其进行了快速实现。采用双端口RAM实现与微控制器(MCU)的挂接,在频率为71.3MHz的时钟下,加速器在MCU控制下完成GF(2160)、GF(2256)、GF(2400)域上标量乘速度分别为323次/秒、181次/秒、89次/秒。 On operation rules based on polynomial base (PB) in GF(2^m) are analyzed and wide applications of different irreducible polynomials, the design scheme and fast implementation of a universal accelerator based on PB over GF (2m) (160≤ m ≤400) is given. A dual-port RAM is used to connect the accelerator with MCU, and the rate of scalar multiplication is respective about 323 per second, 181 per second, 89 per second over GF(2^160), GF(2^256), GF(2^400) under the control of MCU.
出处 《计算机工程与设计》 CSCD 北大核心 2008年第12期3026-3029,共4页 Computer Engineering and Design
关键词 有限域 多项式基 椭圆曲线密码体制 快速实现 双端口RAM finite field polynomial base elliptic curve cryptosystem fast implementation dual-port RAM
  • 相关文献

参考文献8

二级参考文献40

  • 1杨帆,郝林.椭圆曲线上点的数乘的一种固定窗口算法[J].计算机工程与设计,2005,26(5):1152-1154. 被引量:1
  • 2Lopez J, Dahab R. Improved Algorithm for Elliptic Curve Arithmetic in GE(2n)[M]. Selected Areas in Cryptography-SAC'98[C], LNCS,1999:201-212.
  • 3IEEE P1363, Standard Specifications for Public Key Cryptography[EB/OL]. http://grouper.ieee.org/groups/1363/,2000-08.
  • 4Kwon S, Ryn H. Efficient Bit Serial Multiplication in GF(2^m) for a Class of Finite Fields[C]. ICOIN 2003, LNCS, 2003:762-771.
  • 5Koc C K, Sunar B. Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields[J].lEEE Trans Computers,1998,47(3):353-356.
  • 6IEEE std P1363-2000. Standard specifications for public key cryptography[EB/OL].http.//grouper ieee. org/groups/1363 /.
  • 7Hasan M A, Wang M.A modified massey-omura parallel multiplier for a class of finite fields[J]. IEEE Trans Computers, 1993,42(10): 1278-1280.
  • 8Sunar B, Koc C K. An efficient optimal normal basis type II multiplier [J]. IEEE Trans. Computers, 2001,50(1):83-87.
  • 9Akira H, Naofumi T. A fast addition algorithm for elliptic curve in GF(2^n) using projective coordinates[J].Information Processing Letters, 2000,76:101-103.
  • 1002J Solinas. Efficient arithmetic on koblitz curves[J]. Designs,Codes and Cryptography, 2000,(19): 195-249.

共引文献10

同被引文献11

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部