A Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms

IEEE Transactions on Computers

Volumn 43, Issue 8, 1994, Pages 892-898

  Kornerup, Peter ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

comple ment multiplication modulo multiplication and exponentiation RSA modular inverse modular division exact division Hensel codes; Systolic array digit serial multiplier 2

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; CRYPTOGRAPHY; DIGITAL ARITHMETIC; FLIP FLOP CIRCUITS; LOGIC CIRCUITS; SWITCHING THEORY;

DIGIT SERIAL MULTIPLIERS; EXACT DIVISION; HENSEL CODES; MODULAR DIVISION; MODULAR INVERSE; MODULO MULTIPLICATION; RIGHT SHIFT ALGORITHMS; SYSTOLIC LINEAR ARRAY MULTIPLIER; TWO'S COMPLEMENT MULTIPLICATION;

MULTIPLYING CIRCUITS;

EID: 0028482946     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.295851     Document Type: Article

References (10)

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,” in Proc. 6th IEEE Symp. Comput. Arithmetic, IEEE Computer Society, June 1983, pp. 52-59.
3. R. T. Gregoiy 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,” in Proc. 11th IEEE Symp. Comput. Arithmetic, IEEE Computer Society, 1993, pp. 277-283.
7. E. V. Krishnamurthy, T. M. Rao and K. Subramanian, “Finite segment p-adic number systems with applications to exact computation,” in Proc. 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,” in Proc. 11th IEEE Symp. Comput. Arithmetic, IEEE Computer Society, 1993, pp. 252-259.
10. C. D. Walker, “Systolic modular multiplication,” IEEE Trans. Comput., vol. C-42, no. 3, pp. 376-378, Mar. 1993.