Residue Number Systems (RNS) are proven to be effective in speeding up computations involving additions and products. For these representations, there exists efficient modular reduction algorithms that can used the context of arithmetic over finite fields or modulo large numbers, especially when cryptographic engineering. Their independence allows random draws bases, which also makes it possibl...