HARDWARE ARCHITECTURE FOR BOOTH-BARRETT’S MODULAR MULTIPLICATION

N. Nedjah and L.M. Mourelle

References

  1. [1] R. Rivest, A. Shamir, & L. Adleman, A method for obtaining digital signature and public-key cryptosystems, Comm. ACM, 21, 1978, 120–126. doi:10.1145/359340.359342
  2. [2] E.F. Brickell, A survey of hardware implementation of RSA, Proc. CRYPTO’98 (Lecture Notes in Computer Science 435) (Santa Barbara, CA: Springer-Verlag, 1989), 368–370.
  3. [3] C.D. Walter, Systolic modular multiplication, IEEE Trans. on Computers, 42 (3), 1993, 376–378. doi:10.1109/12.210181
  4. [4] S.E. Eldridge & C.D. Walter, Hardware implementation of Montgomery’s modular multiplication algorithm, IEEE Trans. on Computers, 42 (6), 1993, 619–624. doi:10.1109/12.277287
  5. [5] C¸.K. Ko¸c, High-speed RSA implementation, Technical report, RSA Laboratories, RSA Data Security, Inc., Redwood City, CA, November 1994.
  6. [6] G.R. Blakley, A computer algorithm for the product AB modulo M, IEEE Trans. on Computers, 32 (5), 1983, 497–500. doi:10.1109/TC.1983.1676262
  7. [7] P.L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, 44, 1984, 519–521. doi:10.2307/2007970
  8. [8] N. Nedjah & L. de Macedo Mourelle, Fast reconfigurable systolic hardware for modular multiplication and exponentiation, Journal of Systems Architecture, 49, 2003, 387–396. doi:10.1016/S1383-7621(03)00089-4
  9. [9] J. Rabaey, Digital integrated circuits: A design perspective (Englewood Cliffs, NJ: Prentice-Hall, 1995).
  10. [10] A. Booth, A signed binary multiplication technique, Journal of Mechanics and Applied Mathematics, 4, 1951, 236–240. doi:10.1093/qjmam/4.2.236
  11. [11] O. MacSorley, High-speed arithmetic in binary computers, Proc. IEEE, Los Alamitos, CA, 1961, 67–91.
  12. [12] G.W. Bewick, Fast multiplication algorithms and implementation, doctoral diss., Department of Electrical Engineering, Stanford University, 1994.
  13. [13] P. Barrett, Implementing the Rivest, Shamir and Aldham public-key encryption algorithm on standard digital signal processor, Proc. CRYPTO’86 (Lecture Notes in Computer Science 263) (Santa Barbara, CA: Springer-Verlag, 1986), 311– 323.
  14. [14] V. Shindler, High-speed RSA hardware based on low-power pipelined logic, doctoral diss., Institut für Angewandte Information-sverarbeitung und Kommunikations-technologie, Technishe Universität Graz, 1997.
  15. [15] C.D. Walter, A verification of Brickell’s fast modular multiplication algorithm, International Journal of Computer Mathematics, 33, 1990, 153–169. doi:10.1080/00207169008803847
  16. [16] Z. Navabi, VHDL: Analysis and modeling of digital systems, 2nd ed. (New York, NY: McGraw Hill, 1998).
  17. [17] MyCad, Inc. & Seodu Logic, Inc., MyVHDL Station V 4.0 Tutorial, http://www.mycad.com or http://www.mycad.co.kr.
  18. [18] XilinxTM, Foundations Series Software, http://www.xilinx.com.

Important Links:

Go Back