Issue No. 09 - September (2003 vol. 52)
Alexandre F. Tenca , IEEE
?etin K. Ko? , IEEE
<p><b>Abstract</b>—This paper presents a scalable architecture for the computation of modular multiplication, based on the Montgomery multiplication (MM) algorithm. A word-based version of MM is presented and used to explain the main concepts in the hardware design. The proposed multiplier is able to work with any precision of the input operands, limited only by memory or control constraints. Its architecture gives enough freedom to select the word size and the degree of parallelism to be used, according to the available area and/or desired performance. Design trade offs are analyzed in order to identify adequate hardware configurations for a given area or bandwidth requirement.</p>
Cryptography, Montgomery multiplication, modular multiplication, modular multiplier, scalable multiplier.
?. K. Ko? and A. F. Tenca, "A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm," in IEEE Transactions on Computers, vol. 52, no. , pp. 1215-1221, 2003.