
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P. Kornerup, "A Systolic, LinearArray Multiplier for a Class of RightShift Algorithms," IEEE Transactions on Computers, vol. 43, no. 8, pp. 892898, August, 1994.  
BibTex  x  
@article{ 10.1109/12.295851, author = {P. Kornerup}, title = {A Systolic, LinearArray Multiplier for a Class of RightShift Algorithms}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {8}, issn = {00189340}, year = {1994}, pages = {892898}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.295851}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Systolic, LinearArray Multiplier for a Class of RightShift Algorithms IS  8 SN  00189340 SP892 EP898 EPD  892898 A1  P. Kornerup, PY  1994 KW  cryptography; digital arithmetic; multiplying circuits; systolic arrays; logic design; systolic lineararray multiplier; rightshift algorithms; multiplier cell; systolic array; digitserial multiplier; digitproduct terms; least significant digit first; active elements; latches; modulemultiplier; Montgomery modulereduction; RSA encryption; modular inverses; modular division; Hensel codes. VL  43 JA  IEEE Transactions on Computers ER   
A very simple multiplier cell is developed for use in a linear, purely systolic array forming a digitserial multiplier for unsigned or 2'complement operands. Each cell produces two digitproduct 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 modulemultiplier is then developed by incorporating a Montgomery type of modulereduction. 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 backend connections, can compute modular inverses and perform modular division for a power of two as modulus.
[1] A. J. Atrubin, "A onedimensional realtime iterative multiplier,"IEEE Trans. Electron. Comput., vol. EC14, pp. 394399, 1965.
[2] L. Dadda, "Some schemes for fast serial input multipliers," inProc. 6th IEEE Symp. Comput. Arithmetic, IEEE Computer Society, June 1983, pp. 5259.
[3] R. T. Gregory and E. V. Krishnamurthy,Methods and Applications of ErrorFree Computations. New York: SpringerVerlag, 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. 169180, 1993.
[6] P. Kornerup, "Highradix modular multiplication for cryptosystems," inProc. 11th IEEE Symp. Comput. Arithmetic, IEEE Computer Society, 1993, pp. 277283.
[7] E.V. Krishnamurthy, T. M. Rao and K. Subramanian, "Finite segmentpadic number systems with applications to exact computation," inProc. Indian Acad. Sci., vol. 81, 1975, pp. 5879.
[8] P. L. Montgomery, "Modular multiplication without trial division,"Math. Comp., vol. 44, no. 170, pp. 519521, 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. C42, no. 3, pp. 376378, Mar. 1993.