期刊文献+

一种高性能大数模运算单元及其应用 被引量:1

A High Performance Large Integer Modular Arithmetic Unit and Its Applications
下载PDF
导出
摘要 为了加速公钥密码系统的实现速度,设计支持大数模乘和模加减运算的模运算单元是关键。目前的方法多关注于这两种运算的分别实现,为了改善这种方式导致的硬件单元吞吐量低的问题,提出了一种流水线结构的高性能大数模运算单元。基于改进的Montgomery模乘算法,采用流水线技术,把模乘电路分成3个流水线阶段,并把模加减电路结合到第3阶段,得到一种能同时计算模乘和模加减的模运算单元。仿真结果显示,模运算单元以较少的资源占用率获得了较高的吞吐量,非常适合做高性能的公钥密码系统的基本硬件运算单元。 To speed up the public - key cryptographic systems, modular arithmetic unit supporting modular multiplication and modular addition/subtraction is crucial. Current methods are mainly focusing on implementing two separating circuit modules for the operations. However, the throughput of hardware is less using this way. A Pipelined Modular Arithmetic Unit (PMAU) is proposed for high performance modular operations. Based on an improved Montgomery multiplication algorithm, pipelining technique is introduced. The modular multiplication circuit is divided into 3 pipeline stages. Furthermore, the modular addition/subtraction circuit is combined into the third pipeline stage, so the PMAU which supports both modular operations is obtained. Simulation result shows that PMAU achieves high throughput with less hardware resources, so it is suitable for public - key cryptographic systems as basic arithmetic unit.
出处 《计算机仿真》 CSCD 北大核心 2009年第6期339-343,共5页 Computer Simulation
基金 中国科学院研究生院课题项目(06JT079J01)
关键词 模运算 模乘算法 流水线 公钥密码体制 Modular operations Modular multiplication algorithm Pipeline Public - key cryptography
  • 相关文献

参考文献12

  • 1K Sakiyama, N Mentens, L Batina, B Preneel and I Verbauwhede. Recoullgurable Modular Arithmetic Logic Unit for High - Performance Public - Key Cryptosystems[ C]. Int'l Workshop Applied Reconfigurable Computing ( ARC 2006 ), Mar. 2006. 347 - 357.
  • 2Nadia Nedjah and Luiza de Macedo Mourelle. Three Hardware Architectures for the Binary Modular Exponentiation: Sequential, Parallel and Systolic [ J ]. IEEE Trans. Circuits and Systems, Nov. 2005,1(11).
  • 3F Crowe, A Daly and W Maranne. A Scalable Dual Mode Arithmetic Unit for Public Key Crypto6ystems[C]. Proc. IEEE Conf. Information Technology: Coding and Computing ( ITCC 2005 ), Apr. 2005. 568 - 573.
  • 4D Hankerson, A Menezes and S Vanstone 著,张焕国,等译.Guide to Elliptic Curve Cryptography[ M].北京:机械工业出版社,2005.
  • 5L Batina, G Bruin - Muurling and S B O rs. Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems [ C ]. Proceedings of Topics in Cryptology - CTRSA 2004. Lecture Note in Computer Science, Springer - Verlag, 2004,2271. 250 - 263.
  • 6IEEE Standard Specifications for Public - Key Cryptography [ S ]. IEEE Std 1363 -2000. Jan. 2000.
  • 7B Parhami. Computer Arithmetic: Algorithms and Hardware Designs[ M]. Oxford University Press, Inc. , New York, 2000.
  • 8N Koblitz. Elliptic curve cryptosystem[J]. Math. Comp. 1957, 48:203 - 209.
  • 9V Miller. Uses of elliptic curves in cryptography [ C ]. In: H C Williams( Ed. ), Advances in Cryptology : Proceedings of CRYPTO' 85, Lecture Notes in Computer Science, Vol. 218, Springer, Berlin, 1985. 417-426.
  • 10P L Montgomery. Modular Multiplication without Trial Division [J]. Math. Computing, Apr. 1985,44(170):519-521.

同被引文献8

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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