loading...
Performance-Scalable Array Architectures for Modular Multiplication
Boston, Massachusetts July 10-July 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASAP.2000.86238612th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
William L. Freking, University of Minnesota
Keshab K. Parhi, University of Minnesota
Modular multiplication is a fundamental operation in numerous public-key cryptosystems including the RSA method. Increasing popularity of Internet e-commerce and other security applications translate into a demand for a scalable performance hardware design framework. Previous scalable hardware methodologies either were not systolic and thus involved performance-degrading, full-word-length broadcasts or were not scalable beyond linear array size. In this paper, these limitations are overcome with the introduction of three scalable-performance modular multiplication architectures based on systolic arrays. Very high clock rates are feasible, since the cells composing the architectures are of bit-level complexity. Architectural methods based on both binary and high-radix modular multiplication are derived. All techniques are constructed to allow additional flexibility for the impact of interconnects delay within the design environment.
Index Terms:
modular multiplication, systolic arrays, scalable architectures, high-radix algorithms, cylindrical arrays, folding transformation
Citation:
William L. Freking, Keshab K. Parhi, "Performance-Scalable Array Architectures for Modular Multiplication," asap, pp.149, 12th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.