A look-up scheme for scaling in the RNS
Antonio García, A. Lloris · IEEE Transactions on Computers · 1999
Previous scaling schemes have used iterative algorithms, which lead to computation time and memory requirements that increase with the number of moduli. This paper presents a two look-up cycle scaling scheme which allows a diminution of the required memory when nonlarge sets of moduli are considered. This scheme can be combined with previous algorithms for larger sets of moduli.