An Algorithm for Scaling and Single Residue Error Correction in Residue Number Systems
IEEE Transactions on Computers
Modulo Reduction in Residue Number Systems
IEEE Transactions on Parallel and Distributed Systems
A Systolic Redundant Residue Arithmetic Error Correction Circuit
IEEE Transactions on Computers
On Theory and Fast Algorithms for Error Correction in Residue Number System Product Codes
IEEE Transactions on Computers
Fast Combinatorial RNS Processors for DSP Applications
IEEE Transactions on Computers
An RNS Montgomery Modular Multiplication Algorithm
IEEE Transactions on Computers
A Full RNS Implementation of RSA
IEEE Transactions on Computers
NEUROM: a ROM based RNS digital neuron
Neural Networks
Exploiting the Power of GPUs for Asymmetric Cryptography
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
Fast scaling in the residue number system
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Cox-Rower architecture for fast parallel montgomery multiplication
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Toward acceleration of RSA using 3D graphics hardware
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
A high speed coprocessor for elliptic curve scalar multiplications over Fp
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
| Hi-index | 15.00 |
A technique to extend the base of a residue number system (RNS) based on the Chinese remainder theorem (CRT) and the use of a redundant modulus, is proposed. The technique obtains the residue(s) of a given number in the extended moduli without resorting to the traditional mixed-radix conversion (MRC) algorithm. The base extension can be achieved in log/sub 2/n table lookup cycles, where n is the number of moduli in the RNS. The superiority of the technique, compared in terms of latency and hardware requirements to the traditional Szabo-Tanaka method is demonstrated.