期刊文献+

适于流水线结构的改进FIPS算法及其实现 被引量:1

An Improved FIPS Algorithm for Pipeline Structure and Its Implementation
下载PDF
导出
摘要 分析了基于FIPS的乘加器结构的VLSI实现随着操作数宽度的变化,速度和面积的变化趋势;提出了一种改进FIPS算法,解决了采用流水线结构的数据通路导致的数据迟滞问题。在SMIC0.18μm CMOS工艺下,基于该改进算法,设计了一个128位操作数位宽的模乘器,与基于原算法的设计相比,硬件面积增加约5%,效率提高了约42%。利用该模乘器进行1024位RSA运算时,速度可达1.1Mbps。 VLSI implementation of multiplier and accumulator based on FIPS was investigated. Differences in speed and area of implementations based on different operand width were analyzed. To solve the data latency problem caused by the pipeline data path, an improved FIPS algorithm was presented. And a modular multiplier with an operand width of 128 bits was designed based on the improved FIPS in 0. 18μm CMOS technology. Compared with designs based on the original FIPS, the optimized design achieved a 42% of speed improvement with only 5% of area increase. With the modular multiplier, a decryption rate of 1.1 Mbps could be achieved for 1 024-bit RSA.
出处 《微电子学》 CAS CSCD 北大核心 2008年第5期609-613,共5页 Microelectronics
基金 国家自然科学基金资助项目(60576027 60544008) 国家863计划资助项目(2006AA01Z415)
关键词 MONTGOMERY算法 FIPS 乘加器 流水线 模乘器 Montgomery algorithm FIPS Multiplier and accumulator Pipeline Modular multiplier
  • 相关文献

参考文献7

  • 1MONTGOMERY P L. Modular multiplication without trial division [J]. Math of Computation, 1985, 44 (170): 519- 521.
  • 2KOC C K, ACAR T. Analyzing and comparing Montgomery multiplication algorithms [J]. IEEE Micro, 1996, 16(3): 26-33.
  • 3MEHLHORN K, PREPARATA F P. Area time optimal VLSI integer multiplier with minimum computation time [J]. Information and Control, 1983, 58: 137-156.
  • 4WALTER C D. Space/time trade-offs for higher radix modular multiplications using repeated addition [J]. IEEE Trans Computers, 1997, 46(2): 139-141.
  • 5MCIVOR C, MCLOONE M. Fast Montgomery modular multiplication and RSA cryptographic processor architecture [C]//Proc 37th Asilomar Conf Sign, Syst and Comp. New York, USA. 2003:379-384.
  • 6LIU Q, MA F, TONG D, et al. A regular parallel RSA processor [C] // Proc 47th Midwest Syrup Circ and Syst. Hiroshima, Japan. 2004: 467-470.
  • 7刘丽蓓,邵丙铣.基于Montgomery算法的智能卡RSA密码协处理器[J].微电子学,2003,33(5):399-402. 被引量:2

二级参考文献7

  • 1Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystem ['J]. Communications of ACM, 1978, 21(1): 120--126.
  • 2Montgomery P L. Modular multiplication without trial division [J]. Math of Computation, 1985, 44(4): 519-521.
  • 3Walter C D. Systolic modular multiplication [J]. IEEE Trans Computers, 1993, 42 (3): 376-378.
  • 4Eldridge S E, Walter C D. Hardware implementation of Montgomery's modular multiplication algorithm [J]. IEEE Trans Computers, 1993, 42 (6): 693-699.
  • 5Blum T, Paar C. High-radix Montgomery modular exponentiation on reconfigurable hardware [J]. IEEE Trans Computers, 2001, 50 (7): 759-764.
  • 6Koc C K, Acar T. Analyzing and comparing Montgomery multiplication algorithm [J]. IEEE Micro, 1996; 16 (6): 26-33.
  • 7Naccache D, Raihi D. Cryptographic smart cards. IEEE Micro, 1996, 16(6): 14-24.

共引文献1

同被引文献5

  • 1王红霞,王金荣,赵宪生.Montgomery模乘算法的改进及其应用[J].计算机工程与应用,2007,43(20):52-55. 被引量:4
  • 2李佳璐.公开密钥算法RSA的分析及其IP核的实现与验证[D].上海:上海交通大学,2009.
  • 3Cetin Kaya Koc,Tolga Acar,Burton S,et al.Analyzing and Compa-ring Montgomery Multiplication Algorithms[J].IEEE Micro,1996,16(3):26-33.
  • 4Stephen R Dusse,Burton S Kaliski Jr.CiTptographic Libray for theMotorola DSP56000[J].Advances in CiyptoIogy-EUEOCRYPT190,LNCS 473,1991:230-244.
  • 5雷明,叶新,张焕国.Montgomery算法及其快速实现[J].计算机工程,2003,29(14):45-46. 被引量:5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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