Highly parallel modular multiplication in the residue number system using sum of residues reduction

Braden J. Phillips, Yinan Kong, Zhining Lim

Research output: Contribution to journalArticle

11 Citations (Scopus)

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 languageEnglish
Pages (from-to)249-255
Number of pages7
JournalApplicable Algebra in Engineering, Communications and Computing
Volume21
Issue number3
DOIs
Publication statusPublished - 2010
Externally publishedYes

Keywords

  • Modular multiplication
  • Public-key cryptography
  • Residue number systems
  • RNS

Fingerprint Dive into the research topics of 'Highly parallel modular multiplication in the residue number system using sum of residues reduction'. Together they form a unique fingerprint.

  • Cite this