Fast Hardware of Booth-Barrett’s Modular Multiplication for Efficient Cryptosystems
Modular multiplication is fundamental to several public-key cryptography systems such as the RSA encryption system. It is also the most dominant part of the computation performed in such systems. The operation is time consuming for large operands. This paper examines the characteristics of yet another architecture to implement modular multiplication. An experimental modular multiplier prototype is described in VHDL and simulated. The simulation results are presented.
Unable to display preview. Download preview PDF.
- 2.Brickell, E.F.: A survey of hardware implementation of RSA. In: Proc. of CRYPTO 1998. LNCS, vol. 435, pp. 368–370. Springer, Heidelberg (1989)Google Scholar
- 5.Rabaey, J.: Digital integrated circuits: A design perspective. Prentice-Hall, Englewood Cliffs (1995)Google Scholar
- 6.Booth, A.: A signed binary multiplication technique. Journal of Mechanics and Applied Mathematics, 236–240 (1951)Google Scholar
- 7.MacSorley, O.: High-speed arithmetic in binary computers. In: Proc. of the IRE, pp. 67–91 (1961)Google Scholar
- 8.Barrett, P.: Implementating the Rivest, Shamir and Aldham public-key encryption algorithm on standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311–323. Springer, Heidelberg (1986)Google Scholar