revisiting sum of residues modular multiplication回顾和残留的模块化的乘法.pdfVIP

Hindawi Publishing Corporation Journal of Electrical and Computer Engineering Volume 2010, Article ID 657076, 9 pages doi:10.1155/2010/657076 Research Article Revisiting Sum of Residues Modular Multiplication Yinan Kong1 and Braden Phillips2 1 Department of Electronic Engineering, Macquarie University, North Ryde, NSW 2109, Australia 2 Department of Electrical and Electronic Engineering, The University of Adelaide, North Terrace, SA 5005, Australia Correspondence should be addressed to Yinan Kong, ykong@.au Received 30 March 2010; Revised 10 August 2010; Accepted 15 September 2010 Academic Editor: Yong-Bin Kim Copyright © 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. In the 1980s, when the introduction of public key cryptography spurred interest in modular multiplication, many implementations performed modular multiplication using a sum of residues. As the field matured, sum of residues modular multiplication lost favor 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 a