An efficient reverse converter for the 4-moduli set {2/sup n/-1, 2/sup n/, 2/sup n/+ 1, 2/sup 2n/+ 1} based on the new Chinese remainder theorem
The inherent properties of carry-free operations, parallelism and fault-tolerance have made
the residue number system a promising candidate for high-speed arithmetic and specialized …
the residue number system a promising candidate for high-speed arithmetic and specialized …
High-speed and reduced-area modular adder structures for RNS
AA Hiasat - IEEE Transactions on Computers, 2002 - ieeexplore.ieee.org
A modular adder is a very instrumental arithmetic component in implementing online residue-
based computations for many digital signal processing applications. It is also a basic …
based computations for many digital signal processing applications. It is also a basic …
RNS number comparator based on a modified diagonal function
Number comparison has long been recognized as one of the most fundamental non-
modular arithmetic operations to be executed in a non-positional Residue Number System …
modular arithmetic operations to be executed in a non-positional Residue Number System …
Novel power-delay-area-efficient approach to generic modular addition
RA Patel, M Benaissa, N Powell… - IEEE Transactions on …, 2007 - ieeexplore.ieee.org
Modular adders are fundamental arithmetic components typically employed in residue
number system (RNS)-based digital signal processing (DSP) systems. They are widely used …
number system (RNS)-based digital signal processing (DSP) systems. They are widely used …
[PDF][PDF] Efficient RNS bases for cryptography
Residue Number Systems (RNS) are useful for distributing large dynamic range
computations over small modular rings, which allows the speed up of computations. This …
computations over small modular rings, which allows the speed up of computations. This …
RNS bases and conversions
JC Bajard, T Plantard - Advanced Signal Processing …, 2004 - spiedigitallibrary.org
Residue Number Systems (RNS) allow the distribution of large dynamic range computations
over small modular rings, which allows the speed up of computations. This feature is well …
over small modular rings, which allows the speed up of computations. This feature is well …
Fast Modulo 2^{n}-(2^{n-2}+ 1) Addition: A New Class of Adder for RNS
RA Patel, M Benaissa… - IEEE Transactions on …, 2007 - ieeexplore.ieee.org
Efficient modular adder architectures are invaluable to the design of residue number system
(RNS)-based digital systems. For example, they are used to perform residue encoding and …
(RNS)-based digital systems. For example, they are used to perform residue encoding and …
Improved modulo-(2n ± 3) multipliers
H Ahmadifar, G Jaberipur - The 17th CSI International …, 2013 - ieeexplore.ieee.org
Modular adders and multipliers have applications in residue number system (RNS)
arithmetic, cryptography, and error-checking, where general architectures are usually …
arithmetic, cryptography, and error-checking, where general architectures are usually …
On building general modular adders from standard binary arithmetic components
We introduce an excess-δ residue representation for residue number system (RNS)
arithmetic, in which a flag bit selects one or the other subrange within the full range of n-bit …
arithmetic, in which a flag bit selects one or the other subrange within the full range of n-bit …
Merging GF (p) elliptic curve point adding and doubling on pipelined VLSI cryptographic ASIC architecture
A Gutub - International Journal of Computer Science and …, 2006 - eprints.kfupm.edu.sa
This paper merges between elliptic curve addition presents a modified processor
architecture for Elliptic Curve Cryptography computations in Galois Fields GF (p). The …
architecture for Elliptic Curve Cryptography computations in Galois Fields GF (p). The …