Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/59950
Citations
Scopus Web of Science® Altmetric
?
?
Type: Journal article
Title: Highly parallel modular multiplication in the residue number system using sum of residues reduction
Author: Phillips, B.
Kong, Y.
Lim, Z.
Citation: Applicable Algebra in Engineering Communication and Computing, 2010; 21(3):249-255
Publisher: Springer
Issue Date: 2010
ISSN: 0938-1279
1432-0622
Statement of
Responsibility: 
Braden J. Phillips, Yinan Kong and Zhining Lim
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.
Keywords: Modular multiplication
Public-key cryptography
Residue number systems
RNS
Rights: © Springer-Verlag 2010
DOI: 10.1007/s00200-010-0124-2
Appears in Collections:Aurora harvest 5
Electrical and Electronic Engineering publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.