
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Alexandre F. Tenca, ?etin K. Ko?, "A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm," IEEE Transactions on Computers, vol. 52, no. 9, pp. 12151221, September, 2003.  
BibTex  x  
@article{ 10.1109/TC.2003.1228516, author = {Alexandre F. Tenca and ?etin K. Ko?}, title = {A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm}, journal ={IEEE Transactions on Computers}, volume = {52}, number = {9}, issn = {00189340}, year = {2003}, pages = {12151221}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2003.1228516}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm IS  9 SN  00189340 SP1215 EP1221 EPD  12151221 A1  Alexandre F. Tenca, A1  ?etin K. Ko?, PY  2003 KW  Cryptography KW  Montgomery multiplication KW  modular multiplication KW  modular multiplier KW  scalable multiplier. VL  52 JA  IEEE Transactions on Computers ER   
Abstract—This paper presents a scalable architecture for the computation of modular multiplication, based on the Montgomery multiplication (MM) algorithm. A wordbased version of MM is presented and used to explain the main concepts in the hardware design. The proposed multiplier is able to work with any precision of the input operands, limited only by memory or control constraints. Its architecture gives enough freedom to select the word size and the degree of parallelism to be used, according to the available area and/or desired performance. Design trade offs are analyzed in order to identify adequate hardware configurations for a given area or bandwidth requirement.
[1] P.L. Montgomery, Modular Multiplication without Trial Division Math. of Computation, vol. 44, no. 170, pp. 519521, Apr., 1985.
[2] H. Orup, “Simplifying Quotient Determination in HighRadix Modular Multiplication,” Proc. 12th Symp. Computer Arithmetic, pp. 193199, 1995.
[3] C.K. Koc, T. Acar, and B. Kaliski, “Analyzing and Comparing Montgomery Multiplication Algorithms,” IEEE Micro, vol. 16, no. 3, pp. 2633, June 1996.
[4] A. Bernal and A. Guyot, Design of a Modular Multiplier Based on Montgomery's Algorithm Proc. 13th Int'l Conf. Design of Circuits and Integrated Systems (DCIS '98), Nov. 1998.
[5] C.C. Yang, T.S. Chang, and C.W. Jen, A New RSA Cryptosystem Hardware Design Based on Montgomery's Algorithm IEEE Trans. on Circuits and Systems  II: Analog and Digital Signal Processing, vol. 45, no. 7, pp. 908913, July 1998.
[6] C.Y. Su, S.A. Hwang, P.S. Chen, and C.W. Wu, An Improved Montgomery's Algorithm for HighSpeed RSA PublicKey Cryptosystem IEEE Trans. Very Large Scale Integration (VLSI) Systems, vol. 7, no. 2, pp. 280284, June 1999.
[7] S.E. Eldridge and C.D. Walter, “Hardware Implementation of Montgomery's Modular Multiplication Algorithm,” IEEE Trans. Computers, vol. 42, no. 7, pp. 693699, July 1993.
[8] P. Kornerup, "HighRadix Modular Multiplication for Cryptosystems," Proc. 11th IEEE Symp. Computer Arithmetic, G. Jullien, M.J Irwin, and E. Swartzlander, eds., pp. 277283,Windsor, Canada, 1993.
[9] C.D. Walter, "Space/Time TradeOffs for Higher Radix Modular Multiplication Using Repeated Addition," IEEE Trans. Computers, vol. 46, no. 2, pp. 139141, Feb. 1997.
[10] A. Royo, J. Moran, and J.C. Lopez, Design and Implementation of a Coprocessor for Cryptography Applications Proc. European Design and Test Conf., pp. 213217, Mar. 1997.
[11] T. Hamano, N. Takagi, S. Yajima, and F.P. Preparata, O(n)Depth Circuit Algorithm for Modular Exponentiation Proc. 12th IEEE Symp. Computer Arithmetic, S. Knowles and W.H. McAllister, eds., pp. 188192, July 1995.
[12] ÇK. Koç and T. Acar, “Fast Software Exponentiation in${\rm GF}(2^k)$,” Proc. 13th Symp. Computer Arithmetic, pp. 279287, July 1997.
[13] W. Diffie and M.E. Hellman, New Directions in Cryptography IEEE Trans. Information Theory, vol. 22, pp. 644654, 1976.
[14] R.L. Rivest,A. Shamir, and L.A. Adleman,"A Method for Obtaining Digital Signatures and Public Key Cryptosystems," Comm. ACM, vol. 21, pp. 120126, 1978.
[15] A.J. Menezes, Elliptic Curve Public Key Cryptosystems. Boston: Kluwer Academic Publishers, 1993.
[16] Ç.K. Koç and T. Acar, “Montgomery Multplication in$\big. GF(2^k)\bigr.$,” Design, Codes, and Cryptography, vol. 14, no. 1, pp. 5769, 1998.
[17] T. Blum and C. Paar, “Montgomery Modular Exponentiation on Reconfigurable Hardware,” Proc. 14th Symp. Computer Arithmetic, pp. 7077, 1999.
[18] C.D. Walter, “Systolic Modular Multiplier,” IEEE Trans. Computers, vol. 42, no. 3, pp. 376378, Mar. 1993.
[19] D.I. Moldovan and J.A.B. Fortes, “Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays,” IEEE Trans. Computers, vol. 35, no. 1, pp.112, Jan. 1986.
[20] A.F. Tenca and Ç.K. Koç, A Scalable Architecture for Montgomery Multiplication Proc. First Int'l Workshop Cryptographic Hardware and Embedded Systems CHES '99, Ç.K. Koçand C. Paar, eds., pp. 94108, Aug. 1999.
[21] G. Todorov, ASIC Design, Implementation, and Analysis of a Scalable HighRadix Montgomery Multiplier MS thesis, Oregon State Univ., Dec. 2000.
[22] A.F. Tenca, G. Todorov, and Ç.K. Koç, HighRadix Design of a Scalable Modular Multiplier Proc. Workshop Cryptographic Hardware and Embedded Systems, Ç.K. Koç, D. Naccache, and C. Paar, eds., pp. 185201, 2001.
[23] C. Hachez and J.J. Quisquater, “Montgomery Exponentiation with No Final Subtractions: Improved Results,” Proc. Cryptographic Hardware and Embedded Systems—CHES 2000, pp. 293301, 2000.
[24] T. Yanik, E. Savas, and Ç.K. Koç, Incomplete Reduction in Modular Arithmetic IEE Proc.Computers and Digital Techniques, vol. 149, no. 2, pp. 4652, Mar. 2002.
[25] A.F. Tenca, Variable LongPrecision Arithmetic (VLPA) for Reconfigurable Coprocessor Architectures PhD thesis, Univ. California Los Angeles, 1998.
[26] B. Kurniawan, ASIC Design and Implementation of a Parallel Exponentiation Algorithm Using Optimized Scalable Montgomery Multipliers MS thesis, Oregon State Univ., Corvallis, 2002.
[27] E. Savas, A.F. Tenca, and Ç.K. Koç, “A Scalable and Unified Multiplier Architecture for Finite Fields$\big. GF(p)\bigr.$and$\big. GF(2^m)\bigr.$,” Proc. Workshop Cryptographic Hardware and Embedded Systems (CHES 2000), Ç.K. Koçand C. Paar, eds., pp. 277292, 2000.