An improved Montgomery's algorithm for high-speed RSA public-key cryptosystem

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 7, Issue 2, 1999, Pages 280-284

  Su, Chih Yuang ^a   Hwang, Shih Arn ^a   Chen, Po Song ^b   Wu, Cheng Wen ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b WINBOND ELECTRONICS CORPORATION   (Taiwan)

Author keywords

Cellular array; Data security; Modular multiplication; Montgomery's algorithm; Public key cryptography; RSA

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; DATA ACQUISITION; ITERATIVE METHODS; LOGIC CIRCUITS;

MONTGOMERY'S ALGORITHM; PUBLIC-KEY CRYPTOGRAPHY; RIVEST-SHAMIR-ADLEMAN (RSA) CRYPTOSYSTEMS;

CRYPTOGRAPHY;

EID: 0032667653     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/92.766756     Document Type: Article

References (17)

1. R. L. Rivest, A. Shamir, and L. Adleman. "A method for obtaining digital signatures and public-key cryptosystems," Commun. ACM, vol. 21, no. 2, pp. 120-126, Feb. 1978.
2. T. El Gamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," IEEE Trans. Inform. Theory, vol. IT-31, pp. 469-472, July 1985.
3. I. Niven, H. S. Zuckerman, and H. L. Montgomery, An Introduction to the Theory of Numbers. New York: Wiley, 1991.
4. H. Orup, "Exponentiation, modular multiplication and VLSI implementation of high-speed RSA cryptography", Ph.D. dissertation, Dept. Comput. Sci., Univ. Aarhus, Aarhus, Denmark, 1995.
5. E.-H. Lu, L. Harn, J.-Y. Lee, and W.-Y. Hwang. "A programmable VLSI architecture for computing multiplication and polynomial evaluation modulo a positive integer," IEEE J. Solid-State Circuits, vol. 23, pp. 204-207, Feb. 1988.
6. P. W. Baker. "Fast computation of A*B modulo N," Electron. Lett., vol. 23, no. 15, pp. 794-795, July 1987.
7. P. L. Montgomery, "Modular multiplication without trial division," Math. Comput., vol. 44, pp. 519-521, 1985.
8. S. E. Eldridge, "A faster modular multiplication algorithm," Int. J. Comput. Math., vol. 40, pp. 63-68, 1991.
9. C. D. Walter. "Systolic modular multiplication," IEEE Trans. Comput., vol. 42, pp. 376-378, Mar. 1993.
10. P. Kornerup, "A systolic linear-array multiplier for a class of right-shift algorithms," IEEE Trans. Comput., vol. 43, pp. 892-898, Aug. 1994.
11. M. Shand and J. Vuillemin, "Fast implementation of RSA cryptography," in Proc. 11th IEEE Symp. Computer Arithmetic, Windsor, Ont., Canada, June 1993, pp. 252-259.
12. P.-S. Chen, S.-A. Hwang, and C.-W. Wu, "A systolic RSA public key cryptosystem," in Proc. IEEE Int. Symp. Circuits Syst., Atlanta, GA, May 1996, pp. 408-411.
13. C.-C. Yang, "The IC design of a high-speed RSA processor," Master's thesis, Dept. Electron. Eng., National Chiao Tung Univ., Hsinchu, Taiwan, R.O.C., June 1996.
14. D. E. Knuth, Seminumerical Algorithms, The Art of Computer Programming, vol. 2, 2nd ed. Reading, MA: Addison-Wesley, 1981.
15. C. K. Koc and B. S. Kaliski, Jr., "Analyzing and comparing Montgomery multiplication algorithms," J. Microelectromech. Syst., vol. 16, pp. 26-33, June 1996.
16. C. R. Baugh and B. A. Wooley, "A two's complement parallel array multiplication algorithm," IEEE Trans. Comput., vol. C-22, pp. 1045-1047, Dec. 1973.
17. S.-Y. Kung, VLSI Array Processors. Englewood Cliffs, NJ: Prentice-Hall, 1988.