Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.18415 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909054281973760 |
|---|---|
| author | Didier, Laurent-Stéphane Glandus, Léa Mrabet, Nadia El Robert, Jean-Marc |
| author_facet | Didier, Laurent-Stéphane Glandus, Léa Mrabet, Nadia El Robert, Jean-Marc |
| contents | This paper presents a novel method to compare two numbers in Residue Number System (RNS) using an additional modulus, which is often already available because it is required in modular computations and digital signal processing scaling.Our method provides the comparison of two integers in the full range of the RNS base. It does not require moduli of a special form, unlike other state-of-the-art methods that are restricted to specific RNS bases or require bounds on input numbers. Our approach only requires one single conversion to a mixed radix representation with a complexity of O(n2), which can be reduced to O(log(n)) in time with parallelization. This provides a significant advantage over classical methods and more recent competitive methods which work under restrictions. This opens perspectives for advancements in challenging RNS operations such as division, scaling, and cryptographic applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_18415 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Residue Number System Comparison revisited, a software perspective Didier, Laurent-Stéphane Glandus, Léa Mrabet, Nadia El Robert, Jean-Marc Distributed, Parallel, and Cluster Computing This paper presents a novel method to compare two numbers in Residue Number System (RNS) using an additional modulus, which is often already available because it is required in modular computations and digital signal processing scaling.Our method provides the comparison of two integers in the full range of the RNS base. It does not require moduli of a special form, unlike other state-of-the-art methods that are restricted to specific RNS bases or require bounds on input numbers. Our approach only requires one single conversion to a mixed radix representation with a complexity of O(n2), which can be reduced to O(log(n)) in time with parallelization. This provides a significant advantage over classical methods and more recent competitive methods which work under restrictions. This opens perspectives for advancements in challenging RNS operations such as division, scaling, and cryptographic applications. |
| title | Residue Number System Comparison revisited, a software perspective |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2605.18415 |