Some improvement on RNS montgomery modular multiplication

In Residue Number Systems (RNS), an integer X is represented by its residues {x(0),...,x(n-1)} modulo a base of relatively prime numbers {m(0),...,m(n-1)}. Thus a large number can be represented as a set of small integers. Addition and multiplication can be easily parallelized, there is no carry propagation. The time is reduced to the evaluation of these operations with small numbers. This representation is useful in cryptography and digital signal processing. Furthermore, in these two domains, modular multiplication (A x B mod N) is frequently used. So, in 1998, we have presented in IEEE journal of transactions on computers,(20) a new modular multiplication algorithm in RNS. This algorithm is based on the Montgomery algorithm: using the associated Mixed Radix representation; for the weighted digits. It was the first algorithm of this type. In this paper, we present two remarks. First, if we develop the different expressions due to the algorithm, we obtain some mathematical simplifications that allow us to suppress some Mixed Radix occurrence in the basic iteration simply with a new initialization of our variables. Thus, in this new version, the complexity of each basic iteration, becomes equivalent to two products of small integers instead of three. The second remark is that, most of the time, modular multiplications are done with the same modulo N. We can precompute some values and reduce the complexity of each basic iteration to one multiplication of two small integers. Thus, the basic iteration is three time faster and the global computation, due to the initialization, is 8/5 time faster than the original version. Sometime after the last basic iteration a Mixed Radix conversion can be needed. Classical parallel methods are linear. We propose an logarithmic parallel algorithm for this translation from RNS to Mixed Radix. Far this, we use a result that comes from an RNS division algorithm, we published in Journal of VLSI signal processing systems 1998.(3) We obtain in a logarithmic time all approximation of the Mixed radix representation. The correct representation is then established in a logarithmic time tao.