A new algorithm for modular multiplication in the residue number system (RNS) is presented. Modular reduction is performed using a sum of residues. As all of the residues can be evaluated simultaneously, the algorithm permits a highly parallel implementation and is suitable for performing public-key cryptography operations with very low latency.
|Number of pages||7|
|Journal||Applicable Algebra in Engineering, Communications and Computing|
|Publication status||Published - 2010|
- Modular multiplication
- Public-key cryptography
- Residue number systems