.png){kind=icon}
.png){kind=icon}
Return
A scalable architecture for modular multiplication based on Montgomery's algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2003.1228516.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
cryptography
Montgomery multiplication
modular multiplication
modular multiplier
scalable multiplier
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available