The Community for Technology Leaders
Green Image
A mixed radix-4/2 algorithm for modular multiplication/division suitable for VLSI implementation is proposed. The algorithm is based on Montgomery method for modular multiplication and on the extended Binary GCD algorithm for modular division. Both algorithms are modified and combined into the proposed algorithm so that almost all the hardware components are shared. The new algorithm carries out both calculations using simple operations such as shifts, additions, and subtractions. The radix-2 signed-digit representation is used to avoid carry propagation in all additions and subtractions. A modular multiplier/divider based on the algorithm performs an n{\hbox{-}}{\rm bit} modular multiplication/division in O(n) clock cycles where the length of the clock cycle is constant and independent of n. The modular multiplier/divider has a linear array structure with a bit-slice feature and can be implemented with much smaller hardware than that necessary to implement both multiplier and divider separately.
Computer arithmetic, hardware algorithm, modular multiplication, modular division, redundant representation, cryptography.

M. E. Kaihara and N. Takagi, "A Hardware Algorithm for Modular Multiplication/Division," in IEEE Transactions on Computers, vol. 54, no. , pp. 12-21, 2005.
90 ms
(Ver 3.3 (11022016))