한국정보과학회논문지:시스템및이론 (Journal of KIISE:Computer Systems and Theory)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

RNS상에서 시간 및 공간 복잡도 향상을 위한 병렬 모듈러 곱셈 알고리즘

Parallel Modular Multiplication Algorithm to Improve Time and Space Complexity in Residue Number System

  • 발행 : 2003.10.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 RNS 시스템 상에서 시간 및 공간 복잡도 향상을 위한 병렬 모듈러 곱셈 알고리즘을 제안한다. 모듈러 감소를 위해서 새로운 테이블 참조 방식을 사용한다. 테이블 참조시 RNS 시스템이 비 가중치 시스템이므로 대수 비교를 비교하기 위해서 MRS 시스템을 이용한다. 제안한 곱셈 알고리즘은 RNS 컴퓨터 상에서 상대적으로 계간하기 쉬운 MRS 시스템을 사용함으로써 대수 비교를 효율적으로 수행할 수 있다. 기존의 RNS 시스템 상에서 테이블 감소를 이용한 모듈러 곱셈 알고리즘과 비교시 전체 테이블의 크기를 1/2로 줄일 수 있고, 산술 연산도 2ㅣ 개의 프로세서를 사용하여 0(ι) 만에 수행할 수 있다.

In this paper, we present a novel method of parallelization of the modular multiplication algorithm to improve time and space complexity on RNS (Residue Number System). The parallel algorithm executes modular reduction using new table lookup based reduction method. MRS (Mixed Radix number System) is used because algebraic comparison is difficult in RNS which has a non-weighted number representation. Conversion from residue number system to certain MRS is relatively fast in residue computer. Therefore magnitude comparison is easily Performed on MRS. By the analysis of the algorithm, it is known that it requires only 1/2 table size than previous approach. And it requires 0(ι) arithmetic operations using 2ㅣ processors.

키워드

참고문헌

  1. W. Diffie and M. Hellman, 'New Directions in Cryptography,' IEEE Trans. on Info. Theory, vol. IT-22(6) pp. 644-654, 1976
  2. R.L. Rivest, A. Shamir, and L. Adleman, 'A Method for Obtaining Digital Signatures and Public-key Cryptosystems,' Commu. ACM. vol. 21, pp. 120-126, 1978 https://doi.org/10.1145/359340.359342
  3. K.M. Elleithy and M.A. Bayoumi, 'A Systolic Architecture for Modulo Multiplication,' IEEE Trans. on Circuits and Systems-II: Analog and Digital Signal Processing, vol. 42, no. 11, pp. 725-729, Nov. 1995 https://doi.org/10.1109/82.475251
  4. J.C. Bajard, L.S. Didier, and P. Kornerup, 'An RNS Montgomery Modular Multiplication Algorithm,' IEEE Trans. on Computers, vol. 47, no. 7, pp. 766-776, July 1998 https://doi.org/10.1109/12.709376
  5. D. Radhakrishnan and Y. Yuan, 'Novel Approaches to the Design of VLSI RNS Multipliers,' IEEE Trans. on Circuits and Systems-II: Analog and Digital Signal Processing, vol. 39, no. 1, pp. 52-57, Jan. 1992 https://doi.org/10.1109/82.204109
  6. G. Alia and E. Martinelli, 'A VLSI Modulo m Multiplier,' IEEE Trans. on Computers, vol. 40, no. 7, pp. 873-878, July 1991 https://doi.org/10.1109/12.83626
  7. L.L. Yang and L. Hanzo, 'Residue Number System Arithmetic Assisted M-ary Modulation,' IEEE Communications Letters, vol. 3, no. 2, pp. 28-30, Feb. 1999 https://doi.org/10.1109/4234.749352
  8. F.J. Taylor, 'A VLSI Residue Arithmetic Multiplier,' IEEE Trans. on Computers, vol. C-31, no. 6, pp. 540-546, June 1982 https://doi.org/10.1109/TC.1982.1676036
  9. G.A. Jullien, 'Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms,' IEEE Trans. on Computers, vol. C-29, no. 10, pp. 899-905, Oct. 1980 https://doi.org/10.1109/TC.1980.1675473
  10. M. Soderstrand, W.K. Jenkins, G.A. Jullian and F.J. Taylor, Residue Number Systems: Mordern Applications in Digital Signal Processing, New York, IEEE, 1986
  11. V.S. Dimitrov, G.A. Jullien and W.C. Miller, 'A Residue Number System Implementation of Real Orthogonal Transforms,' IEEE Trans. on Signal Processing, vol. 46, no. 3, pp. 563-570, March 1998 https://doi.org/10.1109/78.661325
  12. H.S. Kim, K.J. Lee, J.J. Kim and K.Y. Yoo, 'Partitioned Systolic Multiplier for GF(2^m),' Proc. of the 1999 ICPP Workshops on IWSEC, pp. 192-197, 1999 https://doi.org/10.1109/ICPPW.1999.800061
  13. A. Halbutogullari and C.K. Koc, 'Parallel Multiplication in GF(2^k) using Polynomial Residue Arithmetic,' Design, Codes and Cryptography, to appear, 1999
  14. N.S. Szabo and R.I. Tanaka, Residue Arithmetic and Its Applications to Computer Technology, McGraw-Hill, New York, 1967
  15. F.J. Taylor, 'Residue Arithmetic: A Tutorial with Examples,' Computer, pp. 50-62, May 1984 https://doi.org/10.1109/MC.1984.1659138
  16. Computer Residue Arithmetic: A Tutorial with Examples F.J.Taylor