Bit-level systolic arrays for modular multiplication
This paper presents bit-level cellular arrays implementing Blakley's algorithm for multiplication of twon-bit integers modulo anothern-bit integer. The semi-systolic version uses 3n(n+3) single-bit carry save adders and 2n copies of 3-bit carry look-ahead logic, and computes a pair of binary numbers (C, S) in 3n clock cycles such thatC+Sε[0, 2N). The carry look-ahead logic is used to estimate the sign of the partial product, which is needed during the reduction process. The final result in the correct range [0,N) can easily be obtained by computingC+S andC+S−N, and selecting the latter if it is positive; otherwise, the former is selected. We construct a localized process dependence graph of this algorithm, and introduce a systolic array containing 3nw simple adder cells. The latency of the systolic array is 6n+w−2, wherew=⌈n/2⌉. The systolic version does not require broadcast and can be used to efficiently compute several modular multiplications in a pipelined fashion, producing a result in every clock cycle.
Key Wordsmodular multiplication carry save adders sign estimation systolic array scheduling
Unable to display preview. Download preview PDF.
- 5.K. Hwang,Computer Arithmetic, Principles, Architecture, and Design. New York: John Wiley, 1979.Google Scholar
- 6.E.E. Swartzlander, (ed.),Computer Arithmetic, vol. I and II. Los Alamitos: IEEE Computer Society Press, 1990.Google Scholar
- 7.D. Simmons and S.E. Tavares “An NMOS implementation of a large number modulo multiplier for data encryption systems.” InProceedings of the 1983 IEEE Custom Integrated Circuits Conference, Rochester, New York: IEEE Press, 1983, pp. 262–266.Google Scholar
- 13.S.Y. Kung, “VLSI Array Processors.” Englewood Cliffs, NJ: Prentice-Hall, 1988.Google Scholar
- 15.E.F. Brickell, “A survey of hardware implementations of RSA.” In (G. Brassard, ed.)Advances in Cryptology-Crypto 89, Proceedings, Lecture Notes in Computer Science, No. 435, New York: Springer-Verlag, 1989, pp. 368–370.Google Scholar
- 16.C.N. Zhang, H.L. Martin, and D.Y.Y. Yun, “Parallel algorithms and systolic arrays designs for RSA cryptosystem.” In (K. Bromley, S.Y. Kung, and E. Swartzlander, ed.,Proceedings of the International Conference on Systolic Arrays, San Diego, California, Los Alamitos: IEEE Computer Society Press, 1988, pp. 341–350.CrossRefGoogle Scholar
- 17.E.F. Brickell, “A fast modular multiplication algorithm with application to two key cryptography.” In (D. Chaum, R.L. Rivest, and A.T. Sherman, ed.)Advances in Cryptology, Proceedings of Crypto 82 New York: Plenum Press, 1982, pp. 51–60.Google Scholar