This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition
February 1997 (vol. 46 no. 2)
pp. 139-141

Abstract—The value of using a higher radix for modular multiplication in the context of RSA is investigated. The main conclusion is that for algorithms which perform the multiplication via repeated addition, there is, broadly speaking, a direct trade-off between space and time provided by change of radix. Thus chip area utilized is roughly proportional to speed. However, initially, as the radix is increased from 2, there is a short-lived increase in speed greater than the extra area used.

[1] R.P. Brent and H.T. Kung, "The Area-Time Complexity of Binary Multiplication," J. ACM, vol. 28, pp. 521-534, 1981.
[2] E.F. Brickell, "A Fast Modular Multiplication Algorithm with Application to Two-Key Cryptography," Advances in Cryptology—CRYPTO '82, Chaum et al., eds., pp. 51-60.New York: Plenum, 1983.
[3] W.K. Luk and J.E. Vuillemin, "Recursive Implementation of Optimal Time VLSI Integer Multipliers," Proc. VLSI '83, F. Anceau and E.J. Aas, eds. Elsevier Science, 1983.
[4] K. Mehlhorn and F.P. Preparata, "Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time," Information and Control, vol. 58, pp. 137-156, 1983.
[5] P.L. Montgomery, "Modular Multiplication without Trial Division," Math. Computation, vol. 44, pp. 519-521, 1985.
[6] R.L. Rivest,A. Shamir, and L.A. Adleman,"A Method for Obtaining Digital Signatures and Public Key Cryptosystems," Comm. ACM, vol. 21, pp. 120-126, 1978.
[7] C.D. Walter, "Faster Modular Multiplication by Operand Scaling," Advances in Cryptology—CRYPTO '91, Lecture Notes in Computer Science, vol. 576, pp. 313-323. Springer-Verlag, 1992.
[8] S.E. Eldridge and C.D. Walter, “Hardware Implementation of Montgomery's Modular Multiplication Algorithm,” IEEE Trans. Computers, vol. 42, no. 7, pp. 693-699, July 1993.

Index Terms:
Computer arithmetic, cryptography, RSA, modular multiplication, redundant number systems, higher radix, optimal speed.
Citation:
Colin D. Walter, "Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition," IEEE Transactions on Computers, vol. 46, no. 2, pp. 139-141, Feb. 1997, doi:10.1109/12.565588
Usage of this product signifies your acceptance of the Terms of Use.