Efficient Hardware Operations for the Residue Number System by Boolean Minimization

Residue number systems (RNS) represent numbers by their remainders modulo a set of relatively prime numbers. This paper proposes an efficient hardware implementation of modular multiplication and of the modulo function (X(mod P)), based on Boolean minimization. We report experiments showing a performance advantage up to 30 times for our approach vs. the results obtained by state-of-the-art industrial tools