Reducing memory requirements in CSA-based scalable Montgomery modular multipliers
Tao Wu · 2014
Scalable Montgomery modular multiplier is able to perform multiprecision Montgomery modular multiplications in limited hardware, but it requires memory units to store pipelined temporary results. These memory units are called FIFO, whose range increases as a result of longer operands. In this paper, two techniques are proposed to reduce the FIFO memory units in CSA-based scalable Montgomery modular multipliers by about 50%. They are then validated by synthesis results with an example.