This paper describes an algorithm and architecture based on an extension of a scalable radix-2 architecture proposed in a previous work. The algorithm is proven to be correct and the hardware design is discussed in detail. Experimental results are shown to compare a radix-8 implementation witha radix-2 design. The scalable Montgomery multiplier is adjustable to constrained areas yet being able to work on any given precision of the operands. Similar to some systolic implementations, this design avoid the high load on signals that broadcast to several components, making the delay independent of operand’s precision.
CITATION STYLE
Tenca, A. F., Todorov, G., & Koç, Ç. K. (2001). High-radix design of a scalable modular multiplier. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2162, pp. 185–201). Springer Verlag. https://doi.org/10.1007/3-540-44709-1_17
Mendeley helps you to discover research relevant for your work.