期刊文献+

基于流水线技术的并行模幂算法硬件实现 被引量:2

Hardware Implementation of Parallel Modular Exponentiation Algorithm Based on Pipelining Technique
下载PDF
导出
摘要 针对R-L模幂算法并行硬件实现成本高的问题,提出一种流水线形式的模幂运算结构。采用流水线技术对模幂算法中Montgomery模乘运算进行硬件设计,并由此构建模幂运算结构,实现并行模幂运算,降低硬件成本。同时对模幂算法中预处理和后处理步骤进行优化,以减少迭代次数。Virtex-2系列现场可编程门阵列原型的实现结果表明,在保证并行模幂运算速度的前提下,该结构的硬件实现成本近似为传统并行结构的1/2,且数据吞吐率更高,可达14 Mb/s。 An efficient pipelined architecture is presented in this paper for solving the problem of high hardware cost of R-L modular exponentiation algorithm, which is formed of Montgomery modular multiplication built by using pipelining technique. The parallel calculation of algorithm can be executed and the hardware cost can be also reduced in the new architecture. Besides, two extra pre-processing and post-processing for converting an integer to its N-residue format in the conventional modular exponentiation algorithm are avoided to reduce the iteration time. The result shows that the new architecture can achieve high data throughput rate of more than 14 Mb/s on Xilinx Field Programmable Gata Array(FPGA) of Virtex-2 series when performs modular exponentiation, while occupy only about half hardware resources when compared with the conventional parallel architecture.
出处 《计算机工程》 CAS CSCD 2013年第7期16-20,25,共6页 Computer Engineering
关键词 蒙哥马利算法 模乘 模幂 RSA公钥密码体制 流水线技术 现场可编程门阵列原型 Montgomery algorithm modular multiplication modular exponentiation RSA public-key cryptosystem pipeliningtechnique Field Programmable Gata Array(FPGA) prototype
  • 相关文献

参考文献10

  • 1Kwon T W, You C S, Heo W S, et al. Two Implementation Methods of a 1 024-bit RSA Cryptoprocessor Based on Modi- fied Montgomery Algorithm[C]//Proc. of ISCAS'01. Sydney, Australia: IEEE Press, 2001.
  • 2Shieh Ming-Der, Chen Jun-Hong, Wu Hao-Hsuan, et al. A New Modular Exponentiation Architecture for Efficient Design of RSA Cryptosystem[J]. IEEE Transactions on Very Large Scale Integration(VLSI) Systems, 2008, 16(9): 1151- 1161.
  • 3Shieh Ming-Der, Chen Jun-Hong, Wu Hao-Hsuan, et al. A New Algorithm for High-speed Modular Multiplication Design[J]. IEEE Transactions on Circuits and Systems, 2009, 56(9): 2009-2019.
  • 4薛念,潘赟,张宇弘,严晓浪.基于Montgomery模乘的RSA加密处理器[J].计算机工程,2010,36(13):125-127. 被引量:6
  • 5Walter C D. Systolic Modular Multiplication[J]. IEEETransactions on Computers, 1993, 42(3): 376-378.
  • 6王旭,董威,戎蒙恬.基于改进Montgomery模乘算法的RSA加密处理器的实现[J].上海交通大学学报,2004,38(2):240-243. 被引量:5
  • 7张远洋,李峥,杨磊,张少武.一种新型的基于Montgomery的模幂器结构[J].计算机工程,2007,33(16):211-213. 被引量:2
  • 8Mcivor C, Mcloone M, Mccanny J V. Modified Montgomery Modular Multiplication and RSA Exponentiation Techni- ques[J], lEE Proceedings-Computers and Digital Techniques, 2004, 151(6): 402-408.
  • 9. Hu Zhengbing, Shboulr R M, Shirochin V P. An Efficient Architecture of 1 024-bits Cryptoprocessor for RSA Crypto- system Based on Modified Montgomery's Algorithm[C]//Proc. oflDAACS'07. Dortmund, Germany: Is. n.], 2007.
  • 10Stallingsw密码编码学与网络安全——原理与实践[M].3版.刘玉珍,译.北京:电子工业出版社,2004.

二级参考文献24

  • 1[1]Kwon T W, You C S, Heo W S, et al. Two implemention methods of a 1 024-bit RSA cryprocessor based on modified Montgomery algorithm [A].IEEE International Symp on Circuits and System[C]. [s. l. ]:IEEE, 2001. 650-653.
  • 2[2]Koc C K, Hung C Y. Multi-operand modulo additional using carry save adders [J]. Eieetonics Letters, 1990,26 (6): 361 - 363.
  • 3[3]Blum T, Paar C. Montgomery modular exponentiation on reconfigurable hardware [A]. Proc 14th IEEE Symp on Computer Arithmetic [C ]. [s. l. ]:IEEE, 1999. 70-77.
  • 4[4]Montgomery P L. Modular multiplication without trial division [J]. Math Computation,1985, 44:519-521.
  • 5Montgomery P L.Modular Multiplication Without Trial Division[J].Mathematics of Computation,1985,44(1):519-521.
  • 6Kwon T W,You C S,Heo W S,et al.Two Implementation Methods of a 1024-bit RSA Cryptoprocessor Based on Modified Montgomery Algorithm[C] //Proc.of ISCAS'01.Sydney,NSW,Australia:IEEE Press,2001.
  • 7Banimov V,Schimmler M,Tolg B.A Complexity-effective Version of Montgomery's Algorithm[C] //Proc.of ISCA'02.Anchorage.Alaska,USA:[s.n.] ,2002.
  • 8Mcivor C,Mcloone M,Mccarmy J V.Modified Montgomery Modular Multiplication and RSA Exponentiation Techniques[J].IEEE Proceedings of Computers and Digital Techniques,2004,151(6):402-408.
  • 9Fang Gang,Ma Guangsheng,Yang Zhi.Implementation of RSA Based on Modified Montgomery Modular Multiplication Algorithm[C] //Proc.of International Conference on Scientific Computing.Las Vegas,Nevada,USA:[s.n.] ,2006.
  • 10Hu Zhengbing,Shboulr R M,Shirochin V P.An Efficient Architecture of 1024-bits Cryptoprocessor for RSA Cryptosystem Based on Modified Montgomery's Algorithm[C] //Proc.of IDAACS'07.Dortmund,Germany:[s.n.] ,2007.

共引文献8

同被引文献22

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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