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 N is the product of the moduli, there is, in an interval of length N, 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}<m_{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 m_is. 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 in the interval 0, ..., M.

In applications where one is also interested with negative integers, it is often more convenient to represent integers belonging to an interval centered at 0. In this case, if M is odd, each set of residues represents exactly one integer of absolute value at most ${\displaystyle {\frac {M}{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.[2]

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.

See also

• Covering system
• Reduced residue system

References

1. Parhami, Behrooz (2010). Computer Arithmetic: Algorithms and Hardware Designs (2 ed.). New York, USA: Oxford University Press. ISBN 978-0-19-532848-6. Archived from the original on 2020-08-04. Retrieved 2021-01-23. (xxv+641 pages)
2. Isupov, Konstantin (2020-04-07) [2020-03-20, 2020-03-08, 2020-02-17]. "Using Floating-Point Intervals for Non-Modular Computations in Residue Number System". IEEE Access. 8: 58603–58619. doi:10.1109/ACCESS.2020.2982365. ISSN 2169-3536. Archived from the original on 2021-01-23. Retrieved 2021-01-23.

Further reading

• Szabo, Nicholas S.; Tanaka, Richard I. (1967). Residue Arithmetic and its Applications to Computer Technology (1 ed.). New York, USA: McGraw-Hill.
• Sonderstrand, Michael A.; Jenkins, W. Kenneth; Jullien, Graham A.; Taylor, Fred J., eds. (1986). Residue Number System Arithmetic: Modern Applications in Digital Signal Processing. IEEE Press Reprint Series (1 ed.). New York, USA: IEEE Circuits and Systems Society, IEEE Press. ISBN 0-87942-205-X. LCCN 86-10516. IEEE order code PC01982. (viii+418+6 pages)
• Fin'ko [Финько], Oleg Anatolevich [Олег Анатольевич] (June 2004). "Large Systems of Boolean Functions: Realization by Modular Arithmetic Methods". Automation and Remote Control. 65 (6): 871–892. doi:10.1023/B:AURC.0000030901.74901.44. ISSN 0005-1179. LCCN 56038628. S2CID 123623780. CODEN AURCAT. Mi at1588.
• Bajard, Jean-Claude; Méloni, Nicolas; Plantard, Thomas (2006-10-06) [July 2005]. Efficient RNS bases for Cryptography (PDF). IMACS'05: World Congress: Scientific Computation Applied Mathematics and Simulation. Paris, France. HAL Id: lirmm-00106470. Archived (PDF) from the original on 2021-01-23. Retrieved 2021-01-23. (1+7 pages)
• Omondi, Amos; Premkumar, Benjamin (2007). Residue Number Systems: Theory and Implementation. London, UK: Imperial College Press. ISBN 978-1-86094-866-4. (296 pages)
• Mohan, P. V. Ananda (2016). Residue Number Systems: Theory and Applications (1 ed.). Birkhäuser / Springer International Publishing Switzerland. doi:10.1007/978-3-319-41385-3. ISBN 978-3-319-41383-9. LCCN 2016947081. (351 pages)
• Amir Sabbagh, Molahosseini; de Sousa, Leonel Seabra; Chip-Hong Chang, eds. (2017-03-21). Embedded Systems Design with Special Arithmetic and Number Systems (1 ed.). Springer International Publishing AG. doi:10.1007/978-3-319-49742-6. ISBN 978-3-319-49741-9. LCCN 2017934074. (389 pages)
• https://web.archive.org/web/20050217165652/http://www.cs.rpi.edu/research/ps/93-9.ps. Archived from the original on 2005-02-17. Retrieved 2021-01-23. Missing or empty |title= (help) Division algorithms
• Knuth, Donald Ervin. The Art of Computer Programming. Addison Wesley.
• Harvey, David (2010). "A multimodular algorithm for computing Bernoulli numbers". Mathematics of Computation. 79 (272): 2361–2370.
• Lecerf, Grégoire; Schost, Éric (2003). "Fast multivariate power series multiplication in characteristic zero". SADIO Electronic Journal on Informatics and Operations Research. 5 (1): 1–10.
• Orange, Sébastien; Renault, Guénaël; Yokoyama, Kazuhiro (2012). "Efficient arithmetic in successive algebraic extension fields using symmetries". Mathematics in Computer Science. 6 (3): 217–233.
• Yokoyama, Kazuhiro (September 2012). "Usage of modular techniques for efficient computation of ideal operations". International Workshop on Computer Algebra in Scientific Computing. Berlin / Heidelberg, Germany: Springer. pp. 361–362.
• Hladík, Jakub; Šimeček, Ivan (January 2012). "Modular Arithmetic for Solving Linear Equations on the GPU". Seminar on Numerical Analysis. pp. 68–70.
• Pernet, Clément (June 2015). "Exact linear algebra algorithmic: Theory and practice". Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation. Association for Computing Machinery. pp. 17–18.
• Lecerf, Grégoire (2018). "On the complexity of the Lickteig–Roy subresultant algorithm". Journal of Symbolic Computation.
• Yokoyama, Kazuhiro; Noro, Masayuki; Takeshima, Taku (1994). "Multi-Modular Approach to Polynomial-Time Factorization of Bivariate Integral Polynomials". Journal of Symbolic Computation. 17 (6): 545–563.
• Isupov, Konstantin (2021). "High-Performance Computation in Residue Number System Using Floating-Point Arithmetic". Computation. 9 (2): 9. doi:10.3390/computation9020009. ISSN 2079-3197.