Journal of the Institute of Electronics Engineers of Korea SD (대한전자공학회논문지SD)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

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

가상 캐리 예측 덧셈기와 PCI 인터페이스를 갖는 분할형 워드 기반 RSA 암호 칩의 설계

  • Gwon, Taek-Won (Dept.of Electronics Engineering, Kyungpook National University) ;
  • Choe, Jun-Rim (School of Electronic & Electrical Engineering, Kyungpook National University)
  • 권택원 (경북대학교 전자공학과) ;
  • 최준림 (경북대학교 전자전기공학부)
  • Published : 2002.08.01
Download PDF
⟨ Previous Next ⟩

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.

본 논문에서는 가상 캐리 예측 덧셈기(pseudo carry look-ahead adder)를 사용하여 분할형 워드 기반 RSA의 구현에 관한 방법을 제안하고 검증하였다. 효율적인 모듈라 곱셈기의 설계를 위해 병렬 2단CSA(carry-save adder) 구조를 사용하였으며 마지막 덧셈의 고속 처리를 위하여 캐리 발생과 지연시간이 짧은 가상 캐리 예측 덧셈기를 적용하였다. 제안한 모듈라 곱셈기는 분할형 워드를 기반으로하여 다음 모듈라 연산을 위해 매 클럭마다 쉬프트와 정렬 연산이 필요없기 때문에 하드웨어를 줄일 수 있으며 고속 모듈라 곱셈 연산을 가능하게한다. 제안한 연산 구조를 PCI 인터페이스를 갖는 FPGA로 기능을 검증한 후 0.5㎛ 삼성 gate array 공정을 사용해서 256 워드 모듈라 곱셈기를 기반으로 한 1024-bit RSA 암호프로세서를 단일 칩으로 구현하였다.

Keywords

References

  1. 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 https://doi.org/10.1145/359340.359342
  2. T. Blum and C. Paar, 'Montgomery modular exponentiation on reconfigurable hardware,' in Proc. 14th IEEE Symposium on Computer Arithmetic, 1999, pp. 70-77 https://doi.org/10.1109/ARITH.1999.762831
  3. C. K. Koc, 'High-Speed RSA Implementation,' Technical Report TR 201, RSA Laboratories, November 1994
  4. C. K. Koc, 'RSA Hardware Implementation,' Technical Report TR 801, RSA Laboratories, April 1996
  5. 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
  6. H. Ling, 'High speed binary adder,' IBM Journal of Research and Development, Vol. 25, No. 3, pp. 156-166, May 1981 https://doi.org/10.1147/rd.252.0156
  7. Lynch, T., and E. Swartzlander, 'A spanning tree carry lookahead adder,' IEEE Trans. Computers, Vol. 41, No. 8, pp. 931-939, 1992 https://doi.org/10.1109/12.156535
  8. 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 https://doi.org/10.1109/ISCAS.2001.922321
  9. Circuits and System, ISCAS 2001 v.4 Two implementation methods of a 1024-bit RSA cryptoprocessor based on modified Montgomery alogorithm T.W.Kwon;J.R.Choi(etc.)