A NEW RSA CRYPTOSYSTEM HARDWARE IMPLEMENTATION BASED ON MONTGOMERY'S ALGORITHM

被引：1

作者：

卢君明

林争辉

机构：

来源：

Journal of Shanghai Jiaotong University(Science) | 2002年 / 01期

关键词：

Montgomery algorithm; modular multiplication; RSA; public key crytosystem;

D O I：

暂无

中图分类号：

TN918.91 [通信安全技术];

学科分类号：

0839 ; 1402 ;

摘要：

RSA public key crypto system is a relatively safe technology, which is widely used in today’s secure electronic communication. In this paper, a new implementation method to optimize a 1 024 bit RSA processor was presented. Basically, a fast modular multiplication architecture based on Montgomery’s algorithm was proposed. Modular exponentiation algorithm scans encryption from right to left, so two modular multiplications can be processed parallel. The new architecture is also fit for an effective I/O interface. The time to calculate a modular exponentiation is about n 2 clock cycles. The proposed architecture has a data rate of 93.7 kb/s for 1 024 bit work with a 100 MHz clock.

引用

页码：46 / 49

页数：4

共 4 条

[1]

Hardware implementation of Montgomery’ s modular multiplication algorithm. Eldridge S W,Walter C D. IEEE Transactions on Computers . 1993

[2]

A new RSA cryptosystem hardware design based on Montgomery’ s algorithm. Yang C C,Chang T S,Jen C W. IEEE Trans on Circuits and System-Ⅱ . 1998

[3]

Securing the commercial internet. Bhimani M. Communications of the ACM . 1996

[4]

An improved Montgomery’ s algorithm for high-speed RSA publickey cryptosystem. Su C Y,Hwang S A,Chen P S,et al. IEEE Transactions on Very Large Scale Integration Systems . 1999

← 1 →