期刊文献+

素数域参数可选高速椭圆曲线密码芯片ASIC实现 被引量:1

A Reconfigurable ASIC Based High Performance Elliptic Curve Cryptographic Chip Over GF(p)
下载PDF
导出
摘要 设计了一款素数域高速椭圆曲线密码芯片,电路采用ASIC实现,支持六种椭圆曲线密码协议:密钥产生,密钥协商,数字签名,数字认证,加密及解密,并且支持椭圆曲线参数的用户配置。在典型情况下,芯片每秒可实现10526次点乘运算,8333次数字签名以及4761次认证,性能优于素数域其他ECC设计。 A high-performance ASIC based elliptic curve cryptographic (CEE) processor was proposed, which was capable of implementing six elliptic curve schemes: Key Generation, Key Agreement, Digital Signature, Digital Verification, Elgamal Encryption and Elgamal Decryption. The processor supports reconfigurable elliptic curves over GF(p) and reaches a high performance of 10526 scalar multiplications, 8333 digital signatures and 4761 digital verifications per second, respectively, in typical case, which is faster than other ECC implementations over prime field.
出处 《微电子学》 CAS CSCD 北大核心 2008年第3期330-333,337,共5页 Microelectronics
基金 国家自然科学基金资助项目(60476015) 国家高技术研究发展(863)计划基金资助项目(2006AA01Z418) 国家部委基金资助项目(20054500224)
关键词 椭圆曲线 ASIC 数字签名 数字认证 点乘 Elliptic curve ASIC Digital signature Digital verification Scalar multiplication
  • 相关文献

参考文献9

  • 1MONTGOMERY P. Modular multiplication without trial division [J]. Mathematics of Computation, 1985, 44(170) : 519-521.
  • 2WU S H, ZHU Y F. A timing-and-area tradeoff GF (p) elliptic curve processor architecture for FPGA [J]. Commun, Circ and Syst, 2005, 2: 1312.
  • 3CIARAN J, MCLVOR M M, JOHN V, et al. Hardware elliptic curve cryptographic processor over GF(p) [J].IEEE Trans Circ and Syst - I: Regular Papers, 2006, 53(9): 1946-1957.
  • 4CIARAN J, MCLVOR M. , JOHN V, et al. FPGA Montgomery modular multiplication architectures suitable for ECCs over GF(p) [C] //Proc Int Syrup Cite and Syst. 2004: III. 509-512.
  • 5ADNAN A-A G, ALEXANDRE F T, CETIN K K. Scalable VLSI architecture for GF (p) Montgomery modular inverse computation [C]//Proc IEEE Comp Soc Ann Symp VLSL 2002: 46-51.
  • 6SIDDIKA B O, LEILA B, BART P. Hardware implementation of elliptic curve over GF(p) [C] // Proc IEEE Appl Spee Syst, Arehitee, and Processors. 2003 : 433-443.
  • 7DNAN A-A G, MOHAMMAD K I, AHMAD K. Pipelining GF(P) elliptic curve cryptography computation [C]//Proc IEEE Int Conf Comp Syst and Appl. 2006. 93-99.
  • 8KENDALL A, DALER R. Design of a reconfigurable processor for NIST prime field ECC [C]// 14th Ann IEEE Symp Field-Programmable Custom Computing Machines. 2006: 333-334.
  • 9ADNAN A-A G, ALEXANDRE F. Efficient scalable hardware architecture for Montgomery inverse computation in GF(P) [C] // IEEE Workshop Signal Processing Systems, 2003: 93-98.

同被引文献6

  • 1Darrel Hankerson, Menezes Alfred,Vanstone Scott.椭圆曲线密码学导论[M].张焕国,译.北京:电子工业出版社,2005.
  • 2Lorencz Robert. New algorithm for classical modularinverse[C]// Cryptographic Hardware And EmbeddedSystems, 2002,Lecture Notes in Computer Science.Redwood Shores : Springer,2003 ; 57-70.
  • 3Hars Laszlo. Modular inverse algorithms without mul-tiplications for cryptographic applications [J]. EUR-ASIP Journal on Embedded System, 2006 : 1-13.
  • 4Certivox. Multiprecision integer and rational arithme-tic C/C+ + library(MIRACL) [EB/OL]. [2012-12-29]. https ://certivox. com/ solutions/miracl-crypto-sdk/.
  • 5张金中,寇应展,王韬,郭世泽,赵新杰.针对滑动窗口算法的椭圆曲线密码故障分析[J].通信学报,2012,33(1):71-78. 被引量:9
  • 6李煜平.金融IC卡在轨道交通领域的应用研究[J].城市轨道交通研究,2012,15(5):28-31. 被引量:4

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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