A new modular exponentiation architecture for efficient design of RSA cryptosystem

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 16, Issue 9, 2008, Pages 1151-1161

  Shieh, Ming Der ^a,b   Chen, Jun Hong ^b   Wu, Hao Hsuan ^b   Lin, Wen Ching ^b  

^a IEEE

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Carry save addition (CSA); Modular exponentiation; Montgomery modular multiplication; RSA cryptosystem; VLSI architecture

Indexed keywords

CHEMICAL SHIFT; CHLORINE COMPOUNDS; CRYPTOGRAPHY; ELECTRIC CURRENTS; MAGNETIC ANISOTROPY; MULTIPLYING CIRCUITS; PUBLIC KEY CRYPTOGRAPHY; SIGNAL FILTERING AND PREDICTION; TREES (MATHEMATICS);

BINARY REPRESENTATIONS; CARRY PROPAGATION; CARRY-SAVE ADDITION (CSA); CRITICAL PATH DELAYS; DATA COMMUNICATIONS; DATA DEPENDENCIES; H-ALGORITHM; HARDWARE COMPLEXITIES; MODULAR EXPONENTIATION; MODULAR MULTIPLICATION; MONTGOMERY MODULAR MULTIPLICATION; PUBLIC KEY CRYPTOSYSTEMS; RSA CRYPTOSYSTEM; SPEED UPS; SQUARE OPERATIONS; VLSI ARCHITECTURE;

ARCHITECTURAL DESIGN;

EID: 50549083561     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2008.2000524     Document Type: Article

References (18)

1. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Trans. Inf. Theory, vol. IT-22, no. 6, pp. 644-654, Nov. 1976.
2. R. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Commun. ACM, vol. 21, pp. 120-126, Feb. 1978.
3. P. L. Montgomery, "Modular multiplication without trial division," Math. Computation, vol. 44, pp. 519-521, Apr. 1985.
4. T. W. Kwon, C. S. You, W. S. Heo, Y. K. Kang, and J. R. Choi, "Two implementation methods of a 1024-bit RSA cryptoprocessor based on modified Montgomery algorithm," in Proc. IEEE Int. Symp. Circuits Syst., May 2001, vol. 4, pp. 650-653.
5. A. Cilardo, A. Mazzeo, L. Romano, and G. P. Saggese, "Carry-save Montgomery modular exponentiation on reconfigurable hardware," in Proc. Des., Autom. Test Eur. Conf. Exhibition, Feb. 2004, vol. 3, pp. 206-211.
6. C. McIvor, M. McLoone, and J. V. McCanny, "Fast Montgomery modular multiplication and RSA cryptographic processor architectures," in Proc. 37th Asilomar Conf. Signals, Syst. Comput, Nov. 2003, vol. 1, pp. 379-384.
7. K. Manochehri and S. Pourmozafari, "Fast Montgomery modular multiplication by pipelined CSA architecture," in Proc. IEEE Int. Conf. Microelectron., Dec. 2004, pp. 144-147.
8. C. McIvor, M. McLoone, and J. V. McCanny, "Modified Montgomery modular multiplication and RSA exponentiation techniques," IEE Proc.-Comput. Digit. Techniques, vol. 151, no. 6, pp. 402-408, Nov. 2004.
9. C. C. Yang, T. S. Chang, and C. W. Jen, "A new RSA cryptosystem hardware design based on Montgomery's algorithm," IEEE Trans. Circuits Syst. II: Analog Digit. Signal Process., vol. 45, no. 7, pp. 908-913, Jul. 1998.
10. Q. Liu, F. Ma, D. Tong, and X. Cheng, "A regular parallel RSA processor," in Proc. IEEE Midw. Symp. Circuits Syst., Jul. 2004, vol. 3, pp. iii-467-iii-470.
11. A. P. Fournaris and O. Koufopavlou, "A new RSA encryption architecture and hardware implementation based on optimized Montgomery multiplication," in Proc. IEEE Int. Symp. Circuits Syst., May 2005, vol. 5, pp. 4645-4648.
12. C. D. Walter, "Systolic modular multiplication," IEEE Trans. Comput., vol. 42, no. 3, pp. 376-378, Mar. 1993.
13. Artisan Components, Sunnyvale, CA, "TSMC 0.13-μm (CL013G) process 1.2-Volt SAGE-XTM standard cell library databook," Jan. 2004.
14. D. E. Knuth, The Art of Computer Programming: Seminumeral Algorithms. New York: Addison-Wesley, 1981, vol. 2.
15. N. Nedjah and L. M. Mourelle, "Three hardware architectures for the binary modular exponentiation: Sequential, parallel, and systolic," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 53, no. 3, pp. 627-633, Mar. 2006.
16. J. H. Hong and C. W. Wu, "Cellular-array modular multiplier for fast RSA public-key cryptosystem based on modified booth's algorithm," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 11, no. 3, pp. 474-484, Jun. 2003.
17. A. Daly and W. Marnane, "Efficient architectures for implementing montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic," in Proc. ACM/SIGDA 10th Int. Symp. FPGAs, Feb. 2002, pp. 40-49.
18. D. I. Moldovan and J. A. B. Fortes, "Partitioning and mapping algorithms into fixed size systolic arrays," IEEE Trans. Comput., vol. 35, no. 1, pp. 1-12, Jan. 1986.