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%.
Cite
CITATION STYLE
Kim, H. S., Park, H. J., & Hwang, S. H. (2004). Parallel modular multiplication algorithm in residue number system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3019, pp. 1028–1033). Springer Verlag. https://doi.org/10.1007/978-3-540-24669-5_133
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
