期刊文献+

基于GF(2^n)的ECC协处理器芯片设计 被引量:3

The Design of an ECC Coprocessor over GF(2n)
下载PDF
导出
摘要 文章讨论了定义在GaloisField(GF)2有限域上椭圆曲线密码体制(ECC)协处理器芯片的设计。首先在详细分析基于GF(2n)ECC算法的基础上提取了最基本和关键的运算,并提出了通过协处理器来完成关键运算步骤,主处理器完成其它运算的ECC加/解密实现方案。其次,进行了加密协处理器体系结构设计,在综合考虑面积、速度、功耗的基础上选择了全串行方案来实现GF(2n)域上的乘和加运算。然后,讨论了加密协处理器芯片的电路设计和仿真、验证问题。最后讨论了芯片的物理设计并给出了样片的测试结果。 The paper discusses the design of a Coprocessor based on the ECC(Elliptic Curve Cryptosystem)defined over GF(2 n ),a finite(Galois)Field.Firstly,primary operations are extracted by analyzing the algorithm about the ECC defined over GF(2 n )in detail.Thereinto,chief operations are executed with the coprocessor.Secondly,the architecture of the encryption coprocessor is designed,the all serial method is selected to perform multiplication and addition defined over GF(2 n )in view of area,speed and power.Finally,circuit design,physical design,simulation and validation of the encryption coprocessor chip are presented.The testing result of the sample chip is provided in the end.
出处 《微电子学与计算机》 CSCD 北大核心 2003年第9期50-54,共5页 Microelectronics & Computer
关键词 ECC 协处理器芯片 设计 GF(2^n) 椭圆曲线密码体制 公钥密码体制 Elliptic Curve Cryptosystem(ECC),Coprocessor,Very Large Scale Integration(VLSI),Chip
  • 相关文献

参考文献2

  • 1Diffie, W and Hellman, M E. Multiuser Cryptographic Techniques. Proc of AFIPS National Computer Conference,1976, 109-112.
  • 2Diffie, W and Hellman, M E. New Directions in Cryptography. IEEEE Trans on Information Theory, Nov,1976, IT-22(6): 644-654.

同被引文献10

  • 1毛淑平,章兢.椭圆曲线加密在智能卡中的应用[J].湖南理工学院学报(自然科学版),2003,16(2):88-91. 被引量:1
  • 2毛天然,李树国.一种基于Normal基椭圆曲线密码芯片的设计[J].微电子学与计算机,2006,23(6):52-55. 被引量:3
  • 3吴永一,李庆,曾晓洋.具有防御功耗攻击性能的双域椭圆曲线密码处理器设计[J].小型微型计算机系统,2006,27(12):2321-2325. 被引量:3
  • 4SEC1:Elliptic Curve Cryptography,Version 1.0[S],2000.
  • 5Harald Aigner, Holger Bock, Markus Hutter, dt al. A low cost ECC coprocessor for smartcards [A]. Infineon Technologies[C]. 2004:107-118
  • 6Leung K H, Ma K W, Wong W K,dt al. FPGA implementation of a microcoded elliptic curve cryptographic processor[C]. IEEE, 2000:68-76
  • 7Hans Eberle, Nils Gura, Sheuehng Chang-Shamz. A cryptographic processor for arbitrary elliptic curves over GF (2^m)[C]. IEEE, 2003
  • 8DAILEY D V, PAAR C. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography [J]. Journal of Cryptology, 2001,14(3):153-176.
  • 9Standard specifications for public key cryptography[S], IEEE P1363-2000, August 2000.
  • 10KOBLITZ N, Elliptic curve cryptosystems[J], Mathematics of Computation, 1987,48(177): 203-209.

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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