期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于双Booth 2编码的双有限域模乘法器设计与实现

Design and implementation of a dual field modular multiplier based on dual Booth 2
下载PDF
导出
摘要 采用双Booth 2编码技术,对高基radix-16 Montgomery模乘法器进行了优化设计,减小了电路面积,提高了模乘运算速度。使用SMIC0.18μm标准单元工艺库综合后,计算256bit有限域GF(P)上的模乘只需要0.51μs。 Optimization is done to the high radix-16 Montgomery modular multiplier based on the dual Booth 2 encoder. The performance is improved so efficiently that it is only 0.51μs to compute a 256bit modular multiplication over under the SMIC0.18μm standard cell technology.
作者 徐金甫 仲先海 杨洋
机构地区 信息工程大学电子技术学院
出处 《电子技术应用》 北大核心 2008年第7期137-139,共3页 Application of Electronic Technique
关键词 布斯编码 MONTGOMERY 有限域 模乘法器 Booth Montgomery finite field modular multiplication
分类号 TN915.61 [电子电信—通信与信息系统] TP332.22 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献4

  • 1MONTGOMERY P L, Mondular multiplication without trial division. Mathematics of Computation, 1985,44(7):519- 521.
  • 2TENCA A F, SAVAS E, KOC C K. A design framework for scalable and unified multipliers in GF(p) and GF(2^m) International Journal of Computer Research, 2004,13 (1): 68-83.
  • 3FAN Yi Bo, ZENG Xiao Yang, GANG Yi Yu,et al. A modified high-radix scalable montgomery multiplier. IEEE International Symposium on Circuit and System(ISCAS), Island of Kos, Greece, May. 2006.
  • 4史焱,吴行军.高速双有限域加密协处理器设计[J].微电子学与计算机,2005,22(5):8-12. 被引量：14

二级参考文献11

  • 1Schneider B. Applied Cryptography: Protocols, Algorithms,and Source Code in C, John Wiley & Sons, New York, 2ndedition, 1996.
  • 2Stinson D R. Cryptography: Theory and Practice, CRCPress, Boca Raton, Florida, 1995.
  • 3Montgomery P L. Modular Multiplication Without Trail Division. Mathematics of Computation, April 1985, 44(170):519～521.
  • 4Kaliski. The Montgomery Inverse and its Applications.IEEE Trans. on Computers, August 1995, 44(8): 1064～1065.
  • 5Gutub, Tenca, Koc,. Scalable VLSI Architecture for GF(p)Montgomery Modular Inverse Computation., ISVLSI 2002- IEEE Computer Society Annual Symposium on VLSI,Pittsburgh, Pennsylvania, 2002, 25～26.
  • 6A Bernal, A Guyot. Hardware for Computing Modular Multiplication Algorithm IEEE Proc. 24th European SolidState Circuits Conference (ESSCIRC' 98) La Hage, Netherlands, September, 1998.
  • 7Savas, Tenca, Koc, . A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF0., In Cryptographic Hardware and Embedded Systems, Lecture Notes in Computer Science. Springer, Berlin, Germany, 2000.
  • 8Savas, Koc. The Montgomery Modular Inverse. Revisited.,IEEE Trans. on Computers, July 2000, 49(7): 763～766.
  • 9Kobayashi, Morita. fast Modular Inversion Algorithm to Match Any Operation Unit. IEICE Trans. Fundamentals,May 1999, E82-A(5):733～740.
  • 10Tenca, Koc. A Scalable Architecture for Mont-gomery Multiplication., In Cryptographic Hardware and Embedded Systems, no. 1717 in Lecture notes in Computer Science,Springer, Berlin, Gemany, 1999.

共引文献13

电子技术应用
2008年 第7期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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