Parallelized radix-4 scalable montgomery multipliers

Journal of Integrated Circuits and Systems

Volumn 3, Issue 1, 2008, Pages 39-45

  Pinckney, Nathaniel ^b   Harris, David Money ^a  

^a HARVEY MUDD COLLEGE   (United States)

^b NONE

Author keywords

Cryptography; Montgomery multiplication; RSA

Indexed keywords

EID: 56849111153     PISSN: 18071953     EISSN: 18720234     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. P. Montgomery, "Modular multiplication without trial division," Math. of Computation, vol. 44, no. 170, pp. 519-521, April 1985.
2. A. Tenca and Ç. Koç, "A scalable architecture for modular multiplication based on Montgomery's algorithm," IEEE Trans. Computers, vol. 52, no. 9, Sept. 2003, pp. 1215-1221.
3. D. Harris, R. Krishnamurthy, M. Anders, S. Mathew, and S. Hsu, "An improved unified scalable radix-2 Montgomery multiplier," Proc. 17th IEEE Symp. Computer Arithmetic, pp. 172-178, 2005.
4. A. Tenca and L. Tawalbeh, "An efficient and scalable radix-4 modular multiplier design using recoding techniques," Proc. Asilomar Conf. Signals, Systems, and Computers, pp. 1445-1450, 2003.
5. A. Tenca, G. Todorov, and Ç. Koç, "High-radix design of a scalable modular multiplier," Cryptographic Hardware and Embedded Systems, Ç. Koç and C. Paar, eds., 2001, Lecture Notes in Computer Science, No. 1717, pp. 189-206, Springer, Berlin, Germany.
6. Y. Fan, X. Zeng, Y. Yu, G. Wang, and Q. Zhang, "A modified high-radix scalable Montgomery multiplier," Proc. Intl. Symp. Circuits and Systems, pp. 3382-3385, 2006.
7. K. Kelley and D. Harris, "Parallelized very high radix scalable Montgomery multipliers," Proc. Asilomar Conf. Signals, Systems, and Computers, pp. 1196-1200, Nov. 2005.
8. K. Kelley and D. Harris, "Very high radix scalable Montgomery multipliers," Proc. 5th Intl. Workshop on System-on-Chip, pp. 400-404, July 2005.
9. H. Orup, "Simplifying quotient determination in high-radix modular multiplication," Proc. 12th IEEE Symp. Computer Arithmetic, pp. 193-199, July 1995.
10. T. Blum and C. Paar, "High-radix Montgomery multiplication on reconfigurable hardware," IEEE Trans. Computers, vol. 50, no. 7, July 2001, pp. 759-764.
11. C. Walter, "Montgomery exponentiation needs no final subtractions," Electronics Letters, vol. 35, no. 21, pp. 1831-1832, 14 October 1999.
12. G. Hachez and J. Quisquater, "Montgomery exponentiation with no final subtractions: improved results," Lecture Notes in Computer Science, C. Koç and C. Paar, eds., vol. 1965, pp. 293-301, 2000.
13. N. Pinckney and D. Harris, "Parallelized radix-4 scalable Montgomery multipliers," Proc. 20th SBCCI Conf. on Integrated Circuits and Systems Design, pp. 306-311, 2007.
14. N. Jiang and D. Harris, "Parallelized Radix-2 Scalable Montgomery Multiplier," IFIP Intl. Conf. on VLSI, 2007.