A scalable architecture for modular multiplication based on Montgomery's algorithm

IEEE Transactions on Computers

Volumn 52, Issue 9, 2003, Pages 1216-1222

  Tenca, Alexandre F ^a   Koç, Çetin K ^a  

^a Oregon State University   (United States)

Author keywords

Cryptography; Modular multiplication; Modular multiplier; Montgomery multiplication; Scalable multiplier

Indexed keywords

ALGORITHMS; CMOS INTEGRATED CIRCUITS; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; COMPUTER SOFTWARE; CONSTRAINT THEORY; CRYPTOGRAPHY; MATHEMATICAL TRANSFORMATIONS; PARALLEL PROCESSING SYSTEMS;

FIRST-ORDER SYSTEM MODEL; MODULAR MULTIPLICATION; MONTGOMERY MULTIPLICATION ALGORITHM; SCALABLE MULTIPLIER;

COMPUTATION THEORY;

EID: 0141831855     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2003.1228516     Document Type: Article

References (27)

1. P.L. Montgomery, "Modular Multiplication without Trial Division," Math. of Computation, vol. 44, no. 170, pp. 519-521, Apr., 1985.
2. H. Orup, "Simplifying Quotient Determination in High-Radix Modular Multiplication," Proc. 12th IEEE Symp. Computer Arithmetic, S. Knowles and W.H. McAllister, eds., pp. 193-199, July 1995.
3. Ç.K. Koç, T. Acar, and B.S. Kaliski, "Analyzing and Comparing Montgomery Multiplication Algorithms," IEEE Micro, vol. 16, no. 3, pp. 26-33, 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. 908-913, July 1998.
6. C.-Y. Su, S.-A. Hwang, P.-S. Chen, and C.-W. Wu, "An Improved Montgomery's Algorithm for High-Speed RSA Public-Key Cryptosystem," IEEE Trans. Very Large Scale Integration (VLSI) Systems, vol. 7, no. 2, pp. 280-284, June 1999.
7. S.E. Eldridge and C.D. Walter, "Hardware Implementation of Montgomery's Modular Multiplication Algorithm," IEEE Trans. Computers, vol. 42, no. 6, pp. 693-699, June 1993.
8. P. Kornerup, "High-Radix Modular Multiplication for Cryptosystems," Proc. 11th IEEE Symp. Computer Arithmetic, E. Swartzlander Jr., M.J. Irwin, and G. Jullien, eds., June 1993.
9. C.D. Walter, "Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition," IEEE Trans. Computers, vol. 46, no. 2, 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. 213-217, 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. 188-192, July 1995.
12. k)," Proc. 13th IEEE Symp. Computer Arithmetic, T. Lang, J.-M. Muller, and N. Takagi, eds., pp. 225-231, July 1997.
13. W. Diffie and M.E. Hellman, "New Directions in Cryptography," IEEE Trans. Information Theory, vol. 22, pp. 644-654, Nov. 1976.
14. R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Comm. ACM, vol. 21, no. 2, pp. 120-126, Feb. 1978.
15. A.J. Menezes, Elliptic Curve Public Key Cryptosystems. Boston: Kluwer Academic Publishers, 1993.
16. k)," Design, Codes, and Cryptography, vol. 14, no. 1, pp. 57-69, Apr. 1998.
17. T. Blum and C. Paar, "Montgomery Modular Exponentiation on Reconfigurable Hardware," Proc. 14th IEEE Symp. Computer Arithmetic, pp. 70-77, Apr. 1999.
18. C. Walter, "Systolic Modular Multiplication," IEEE Trans. Computers, vol. 42, no. 3, pp. 376-378, 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. 1-12 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. 94-108, Aug. 1999.
21. G. Todorov, "ASIC Design, Implementation, and Analysis of a Scalable High-Radix Montgomery Multiplier," MS thesis, Oregon State Univ., Dec. 2000.
22. A.F. Tenca, G. Todorov, and Ç.K. Koç, "High-Radix Design of a Scalable Modular Multiplier, Proc. Workshop Cryptographic Hardware and Embedded Systems, Ç.K. Koç, D. Naccache, and C. Paar, eds., pp. 185-201, 2001.
23. G. Hachez and J.-J. Quisquater, "Montgomery Exponentiation with No Final Subtractions: Improved Results," Lecture Notes in Computer Science, Ç.K. Koç and C. Paar, eds., vol. 1965, pp. 293-301, 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. 46-52, Mar. 2002.
25. A.F. Tenca, "Variable Long-Precision 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. m)," Proc. Second Int'l Workshop Cryptographic Hardware and Embedded Systems-CHES 2000, ÇK. Koç and C. Paar, eds., pp. 277-292, Aug. 2000.