Parallel Modular Multiplication Algorithm in Residue Number System

  • Hyun-Sung Kim
  • Hee-Joo Park
  • Sung-Ho Hwang
Conference paper

DOI: 10.1007/978-3-540-24669-5_133

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3019)
Cite this paper as:
Kim HS., Park HJ., Hwang SH. (2004) Parallel Modular Multiplication Algorithm in Residue Number System. In: Wyrzykowski R., Dongarra J., Paprzycki M., Waśniewski J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg

Abstract

This paper presents a novel method for the parallelization of the modular multiplication algorithm in the Residue Number System (RNS). The proposed algorithm executes modular reductions using a new lookup table along with the Mixed Radix number System (MRS) and RNS. MRS is used because algebraic comparison is difficult in RNS, which has a non-weighted number representation. Compared with the previous algorithm, the proposed algorithm only requires L moduli which is half the number needed in the previous algorithm. Furthermore, the proposed algorithm reduces the number of MUL operations by 25 %.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Hyun-Sung Kim
    • 1
  • Hee-Joo Park
    • 1
  • Sung-Ho Hwang
    • 2
  1. 1.Computer EngineeringKyungil UniversityKyungsansiKorea
  2. 2.Dept. of Computer Eng. and SciPohang University of Sci. and TechPohangsiKorea

Personalised recommendations