A new technique for fast number comparison in the residue number system
From MaRDI portal
Publication:5375310
DOI10.1109/12.223680zbMath1397.65330OpenAlexW2121176637MaRDI QIDQ5375310
S. Impedovo, G. Pirlo, G. Dimauro
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.223680
Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)
Related Items (12)
RNS sign detector based on Chinese remainder theorem II (CRT II) ⋮ Fast RNS division algorithms for fixed divisors with application to RSA encryption ⋮ RNS architectures for the implementation of the `diagonal function' ⋮ The factor-2 sign detection algorithm using a core function for RNS numbers ⋮ Reverse conversion using core function, CRT and mixed radix conversion ⋮ Stability and style-variation modeling for on-line signature verification. ⋮ Positional characteristics for efficient number comparison over the homomorphic encryption ⋮ AC-RRNS: anti-collusion secured data sharing scheme for cloud storage ⋮ A note on RNS architectures for the implementation of the diagonal function ⋮ Algorithm for constructing modular projections for correcting multiple errors based on a redundant residue number system using maximum likelihood decoding ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code ⋮ Core function of an RNS number with no ambiguity
This page was built for publication: A new technique for fast number comparison in the residue number system