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

  • Authors:
  • Braden J. Phillips;Yinan Kong;Zhining Lim

  • Affiliations:
  • The University of Adelaide, School of Electrical & Electronic Engineering, North Terrace, 5005, Adelaide, SA, Australia;The University of Adelaide, School of Electrical & Electronic Engineering, North Terrace, 5005, Adelaide, SA, Australia;The University of Adelaide, School of Electrical & Electronic Engineering, North Terrace, 5005, Adelaide, SA, Australia

  • Venue:
  • Applicable Algebra in Engineering, Communication and Computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.