Parallel Modular Multiplication Algorithm in Residue Number System
- 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
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 %.
Unable to display preview. Download preview PDF.