Parallel Processing and Applied Mathematics

Volume 3019 of the series Lecture Notes in Computer Science pp 1028-1033

Parallel Modular Multiplication Algorithm in Residue Number System

  • Hyun-Sung KimAffiliated withCarnegie Mellon UniversityComputer Engineering, Kyungil University
  • , Hee-Joo ParkAffiliated withCarnegie Mellon UniversityComputer Engineering, Kyungil University
  • , Sung-Ho HwangAffiliated withCarnegie Mellon UniversityDept. of Computer Eng. and Sci, Pohang University of Sci. and Tech

* Final gross prices may vary according to local VAT.

Get Access


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 %.