Issue No.02 - February (2007 vol.56)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2007.20
A new systolic architecture for modular division is proposed in this paper. The architecture is based on a new hardware algorithm for modular division that is extended from the plus-minus algorithm for the greatest common divisor computation. Both the area complexity and the time complexity of the new architecture are linear with respect to the operand bit length. Compared to the architecture using a redundant number representation proposed by Kaihara and Takagi, the new architecture allows a doubled throughput due primarily to the greatly reduced critical path delay, while the area is only about 20 percent larger. Moreover, it is shown that, with a small addition to the control logic, the architecture can also be used to perform Montgomery modular multiplication, thereby efficiently realizing a unified modular multiplier/divider.
Modular division, hardware algorithm, systolic architecture, computer arithmetic, public key cryptosystems.
Guoqiang Bai, Gang Chen, "A New Systolic Architecture for Modular Division", IEEE Transactions on Computers, vol.56, no. 2, pp. 282-286, February 2007, doi:10.1109/TC.2007.20