A Generalized RNS Mclaughlin Modular Multiplication with Non-Coprime Moduli Sets
Zhen Gu, Shuguo Li · IEEE Transactions on Computers · 2019
In this paper, we construct a generalized RNS McLaughlin modular multiplication with non-coprime moduli sets. We use a set of moduli that are non-coprime for RNS in the algorithm to take both the advantage of the fewer multiplications required for a modular multiplication in McLaughlin modular multiplication and the advantage of the moduli sets of similar sizes in classic Montgomery modular multiplication in RNS. This algorithm turns out to be scalable and simple for implementation. Formulas of parameters used for the construction of this algorithm are also presented in this paper.