Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 249-255 |
Number of pages | 7 |
Journal | Applicable Algebra in Engineering, Communications and Computing |
Volume | 21 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2010 |
Externally published | Yes |
Keywords
- Modular multiplication
- Public-key cryptography
- Residue number systems
- RNS