Browse > Article

A Scalable Word-based RSA Cryptoprocessor with PCI Interface Using Pseudo Carry Look-ahead Adder  

Gwon, Taek-Won (Dept.of Electronics Engineering, Kyungpook National University)
Choe, Jun-Rim (School of Electronic & Electrical Engineering, Kyungpook National University)
Publication Information
Abstract
This paper describes a scalable implementation method of a word-based RSA cryptoprocessor using pseudo carry look-ahead adder The basic organization of the modular multiplier consists of two layers of carry-save adders (CSA) and a reduced carry generation and Propagation scheme called the pseudo carry look-ahead adder for the high-speed final addition. The proposed modular multiplier does not need complicated shift and alignment blocks to generate the next word at each clock cycle. Therefore, the proposed architecture reduces the hardware resources and speeds up the modular computation. We implemented a single-chip 1024-bit RSA cryptoprocessor based on the word-based modular multiplier with 256 datapaths in 0.5${\mu}{\textrm}{m}$ SOG technology after verifying the proposed architectures using FPGA with PCI bus.
Keywords
RSA; word-based modular multiplier; pseudo carry look-ahead adder;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Two implementation methods of a 1024-bit RSA cryptoprocessor based on modified Montgomery alogorithm /
[ T.W.Kwon;J.R.Choi(etc.) ] / Circuits and System, ISCAS 2001
2 C. K. Koc, 'RSA Hardware Implementation,' Technical Report TR 801, RSA Laboratories, April 1996
3 R. L. Rivest, A. Shamir, and L. Adleman, 'A method for obtaining digital signatures and public-key cryptosystems,' Communications of the ACM, 21(2):120-126, February 1978   DOI   ScienceOn
4 T. Blum and C. Paar, 'Montgomery modular exponentiation on reconfigurable hardware,' in Proc. 14th IEEE Symposium on Computer Arithmetic, 1999, pp. 70-77   DOI
5 C. K. Koc, 'High-Speed RSA Implementation,' Technical Report TR 201, RSA Laboratories, November 1994
6 T. W. Kwon, J. R. Choi and etc., 'Two implementation methods of a 1024-bit RSA cryptoprocessor based on modified Montgomery alogorithm,' Circuits and System, ISCAS 2001. Vol. 4, pp. 650-653, Sydney, 2001   DOI
7 F. Tenca and C. K. Koc, 'A scalable architecture for Montgomery multiplication', In C. K. Koc and C. Paar, editors, Cryprographic Hardware and Embedded Systems, Lecture Notes in Computer Science No. 1717, pp. 94-108, Springer, Berlin, Germany, 1999
8 H. Ling, 'High speed binary adder,' IBM Journal of Research and Development, Vol. 25, No. 3, pp. 156-166, May 1981   DOI
9 Lynch, T., and E. Swartzlander, 'A spanning tree carry lookahead adder,' IEEE Trans. Computers, Vol. 41, No. 8, pp. 931-939, 1992   DOI   ScienceOn