Name
Abstract | ||
|---|---|---|
The residue number system (RNS) is a method for representing an integer x as an n-tuple of its residues with respect to a given set of moduli. In RNS, addition, subtraction, and multiplication can be carried out by independent operations with respect to each modulus. Therefore, an n-fold speedup can be achieved by parallel processing. The main disadvantage of RNS is that we cannot efficiently compare the magnitude of two integers or determine the sign of an integer. Two general methods of comparison are to transform a number in RNS to a mixed-radix system or to a radix representation using the Chinese remainder theorem (CRT). We used the CRT to derive an equation approximating a value of x relative to M, the product of moduli. Then, we propose two algorithms that efficiently evaluate the equation and output a sign bit. The expected number of steps of these algorithms is of order n. The algorithms use a lookup table that is (n + 3) times as large as M, which is reasonably small for most applications including cryptography. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1587/transfun.2020CIP0020 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | DocType | Volume |
Chinese remainder, residue number system, sign detection, comparison | Journal | E104A |
Issue | ISSN | Citations |
1 | 0916-8508 | 1 |
PageRank | References | Authors |
0.35 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shinichi Kawamura | 1 | 255 | 22.99 |
| Yuichi Komano | 2 | 58 | 10.91 |
| Hideo Shimizu | 3 | 1 | 0.35 |
| Saki Osuka | 4 | 1 | 0.35 |
| Daisuke Fujimoto | 5 | 25 | 6.52 |
| Yu-ichi Hayashi | 6 | 78 | 17.96 |
| Kentaro Imafuku | 7 | 1 | 0.35 |