This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms
August 1994 (vol. 43 no. 8)
pp. 892-898

A very simple multiplier cell is developed for use in a linear, purely systolic array forming a digit-serial multiplier for unsigned or 2'complement operands. Each cell produces two digit-product terms and accumulates these into a previous sum of the same weight, developing the product least significant digit first. Grouping two terms per cell, the ratio of active elements to latches is low, and only upper bound [n]/2 cells are needed for a full n by n multiply. A module-multiplier is then developed by incorporating a Montgomery type of module-reduction. Two such multipliers interconnect to form a purely systolic module exponentiator, capable of performing RSA encryption at very high clock frequencies, but with a low gate count and small area. It is also shown how the multiplier, with some simple back-end connections, can compute modular inverses and perform modular division for a power of two as modulus.

[1] A. J. Atrubin, "A one-dimensional real-time iterative multiplier,"IEEE Trans. Electron. Comput., vol. EC-14, pp. 394-399, 1965.
[2] L. Dadda, "Some schemes for fast serial input multipliers," inProc. 6th IEEE Symp. Comput. Arithmetic, IEEE Computer Society, June 1983, pp. 52-59.
[3] R. T. Gregory and E. V. Krishnamurthy,Methods and Applications of Error-Free Computations. New York: Springer-Verlag, 1984.
[4] K. Hensel,Theorie der Algebraischen Zahlen. Leipzig and Berlin: B. G. Teubner, 1908.
[5] T. Jebelean, "An algorithm for exact division,"J. Symbolic Computat., vol. 15, pp. 169-180, 1993.
[6] P. Kornerup, "High-radix modular multiplication for cryptosystems," inProc. 11th IEEE Symp. Comput. Arithmetic, IEEE Computer Society, 1993, pp. 277-283.
[7] E.V. Krishnamurthy, T. M. Rao and K. Subramanian, "Finite segmentp-adic number systems with applications to exact computation," inProc. Indian Acad. Sci., vol. 81, 1975, pp. 58-79.
[8] P. L. Montgomery, "Modular multiplication without trial division,"Math. Comp., vol. 44, no. 170, pp. 519-521, Apr. 1985.
[9] M. Shand and J. Vuillemin, "Fast implementations of RSA cryptography," presented at the11th IEEE Symp. Comput. Arithmetic, 1993.
[10] C. D. Walker, "Systolic modular multiplication,"IEEE Trans. Comput., vol. C-42, no. 3, pp. 376-378, Mar. 1993.

Index Terms:
cryptography; digital arithmetic; multiplying circuits; systolic arrays; logic design; systolic linear-array multiplier; right-shift algorithms; multiplier cell; systolic array; digit-serial multiplier; digit-product terms; least significant digit first; active elements; latches; module-multiplier; Montgomery module-reduction; RSA encryption; modular inverses; modular division; Hensel codes.
Citation:
P. Kornerup, "A Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms," IEEE Transactions on Computers, vol. 43, no. 8, pp. 892-898, Aug. 1994, doi:10.1109/12.295851
Usage of this product signifies your acceptance of the Terms of Use.