Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKong, Y.-
dc.contributor.authorPhillips, B.-
dc.identifier.citationJournal of Electrical and Computer Engineering, 2010; 2010:1-9-
dc.description.abstractthe 1980s,when the introduction of public key cryptography spurred interest in modularmultiplication, many implementations performed modularmultiplication using a sumof residues. As the fieldmatured, sum of residues modularmultiplication lost favour to the extent that all recent surveys have either overlooked it or incorporated it within a larger class of reduction algorithms. In this paper, we present a new taxonomy of modular multiplication algorithms. We include sum of residues as one of four classes and argue why it should be considered different to the other, now more common, algorithms.We then apply techniques developed for other algorithms to reinvigorate sum of residues modular multiplication. We compare FPGA implementations of modular multiplication up to 24 bits wide. The Sum of Residues multipliers demonstrate reduced latency at nearly 50% compared to Montgomery architectures at the cost of nearly doubled circuit area. The new multipliers are useful for systems based on the Residue Number System (RNS).-
dc.description.statementofresponsibilityYinan Kong and Braden Phillips-
dc.publisherHindawi Publishing Corp-
dc.rightsCopyright © 2010 Y. Kong and B. Phillips. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.-
dc.titleRevisiting sum of residues modular multiplication-
dc.typeJournal article-
dc.identifier.orcidPhillips, B. [0000-0001-8288-4791]-
Appears in Collections:Aurora harvest
Electrical and Electronic Engineering publications

Files in This Item:
File Description SizeFormat 
hdl_62303.pdfPublished version368.47 kBAdobe PDFView/Open

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