# Residue number system

A residue numeral system (RNS) is a numeral system representing integers by their values modulo several pairwise coprime integers called the moduli. This representation is allowed by the Chinese remainder theorem, which asserts that, if M is the product of the moduli, there is, in an interval of length M, exactly one integer having any given set of modular values. The arithmetic of a residue numeral system is also called multi-modular arithmetic.

Multi-modular arithmetic is widely used for computation with large integers, typically in linear algebra, because it provides faster computation than with the usual numeral systems, even when the time for converting between numeral systems is taken into account. Other applications of multi-modular arithmetic include polynomial greatest common divisor, Gröbner basis computation and cryptography.

## Definition

A residue numeral system is defined by a set of k integers

${\displaystyle \{m_{1},m_{2},m_{3},\ldots ,m_{k}\},}$

called the moduli, which are generally supposed to be pairwise coprime (that is, any two of them have a greatest common divisor equal to one). Residue number systems have been defined for non-coprime moduli, but are not commonly used because of worse properties. Therefore, they will not be considered in the remainder of this article.[1]

An integer x is represented in the residue numeral system by the set of its remainders

${\displaystyle \{x_{1},x_{2},x_{3},\ldots ,x_{k}\}}$

under Euclidean division by the moduli. That is

${\displaystyle x_{i}=x\operatorname {mod} m_{i},}$

and

${\displaystyle 0\leq x_{i}

for every i

Let M be the product of all the ${\displaystyle m_{i}}$. Two integers whose difference is a multiple of M have the same representation in the residue numeral system defined by the mis. More precisely, the Chinese remainder theorem asserts that each of the M different sets of possible residues represents exactly one residue class modulo M. That is, each set of residues represents exactly one integer ${\displaystyle X}$ in the interval ${\displaystyle 0,\dots ,M-1}$. For signed numbers, the dynamic range is ${\textstyle -\lfloor M/2\rfloor \leq X\leq \lfloor {\frac {M-1}{2}}\rfloor }$ (when ${\displaystyle M}$ is even, generally an extra negative value is represented).[2]

## Arithmetic operations

For adding, subtracting and multiplying numbers represented in a residue number system, it suffices to perform the same modular operation on each pair of residues. More precisely, if

${\displaystyle [m_{1},\ldots ,m_{k}]}$

is the list of moduli, the sum of the integers x and y, respectively represented by the residues ${\displaystyle [x_{1},\ldots ,x_{k}]}$ and ${\displaystyle [y_{1},\ldots ,y_{k}],}$ is the integer z represented by ${\displaystyle [z_{1},\ldots ,z_{k}],}$ such that

${\displaystyle z_{i}=(x_{i}+y_{i})\operatorname {mod} m_{i},}$

for i = 1, ..., k (as usual, mod denotes the modulo operation consisting of taking the remainder of the Euclidean division by the right operand). Subtraction and multiplication are defined similarly.

For a succession of operations, it is not necessary to apply the modulo operation at each step. It may be applied at the end of the computation, or, during the computation, for avoiding overflow of hardware operations.

However, operations such as magnitude comparison, sign computation, overflow detection, scaling, and division are difficult to perform in a residue number system.[3]

### Comparison

If two integers are equal, then all their residues are equal. Conversely, if all residues are equal, then the two integers are equal, or their differences is a multiple of M. It follows that testing equality is easy.

At the opposite, testing inequalities (x < y) is difficult and, usually, requires to convert integers to the standard representation. As a consequence, this representation of numbers is not suitable for algorithms using inequality tests, such Euclidean division and Euclidean algorithm.

### Division

Division in residue numeral systems is problematic. On the other hand, if ${\displaystyle B}$ is coprime with ${\displaystyle M}$ (that is ${\displaystyle b_{i}\not =0}$) then

${\displaystyle C=A\cdot B^{-1}\mod M}$

can be easily calculated by

${\displaystyle c_{i}=a_{i}\cdot b_{i}^{-1}\mod m_{i},}$

where ${\displaystyle B^{-1}}$ is multiplicative inverse of ${\displaystyle B}$ modulo ${\displaystyle M}$, and ${\displaystyle b_{i}^{-1}}$ is multiplicative inverse of ${\displaystyle b_{i}}$ modulo ${\displaystyle m_{i}}$.

## Applications

RNS have applications in the field of digital computer arithmetic. By decomposing in this a large integer into a set of smaller integers, a large calculation can be performed as a series of smaller calculations that can be performed independently and in parallel.