期刊文献+

基于改进Montgomery模乘算法的智能卡协处理器设计 被引量:2

A Co-processor Design for Smart Card Based on Enhanced Montgomery's Modular Multiplication Algorithm
下载PDF
导出
摘要 传统智能卡所进行的数据加解密运算一般是由软件实现,但随着信息安全要求的进一步提高,在芯片中集成协处理器成为一种趋势。本文就这一问题进行了探讨,并给出了一种解决方案。 Traditionally, cryptograph alogrithym for smartcard were implemented by software. To perform the operation reasonable fast, some specialized hardware,in form of cryptographic co-processors become more attractive. This term disscuss the issue and present a solution for it.
出处 《微电子学与计算机》 CSCD 北大核心 2004年第12期104-106,共3页 Microelectronics & Computer
关键词 蒙哥马利算法 模乘 公钥密码算法 Montgpmery algorithym, Modular multiplication, Public key cryptography
  • 相关文献

参考文献5

  • 1P Montgomery . Modular multiplication without trialdivision. in Mathematics of Computation, Vol. 44,pp. 519-521, Apr 1985.
  • 2P. Kornerup. A systolic, linear-array multiplier for aclass of right-shift algorithms. in IEEE Transactionson computers, vol. 43, pp. 892-898, Aug 1994.
  • 3P Kornerup. High - radix modular multiplication forcryptosystems. in Computer Arithmetic, 1993. Proceedings.,11th Symposium on, pp. 277-283, Jul 1993.
  • 4Jean-Claude Bajard, Laurent-Stephane Didier, and Peter Komerup. AnRNS Montgomery modular multiplication algorithm. IEEE Transaction on Computers, 47(7):766-776,July 1998.
  • 5BruceSchneier(美)著 吴世钟 祝世雄 张文政译.应用密码学,2000,1.

同被引文献5

  • 1Sunar B,Koc C K.An efficient optimal normal basis type Ⅱ multiplier[J].IEEE Trans.Computers,2001,50 (1):83~87
  • 2Lopez J,Dahab R.Improved Algorithms for Euiptic Curve Arithmetic in GF(2^n)[M].SAC'98,LNCS 1556,Springer-Verlah,1998:201~212
  • 3Kwon S,Ryn H.Efficient bit serial multiplication in GF (2^m) for a class of finite Fields[J].ICOIN 2003,LNCS2662,2003:762~781
  • 4雷咏梅,赵霖.椭圆曲线密码体制的VLSI并行算法研究[J].微电子学与计算机,1999,16(5):5-9. 被引量:1
  • 5杨君辉,戴宗铎,杨栋毅刘宏伟.关于椭圆曲线密码的实现[J].通信技术,2001,34(6):1-3. 被引量:10

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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