Fast montgomery modular multiplication by pipelined CSA architecture

Proceedings of the International Conference on Microelectronics, ICM

Volumn , Issue , 2004, Pages 144-147

  Manochehri, Kooroush ^a   Pourmozafari, Saadat ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

ADDERS; ALGORITHMS; CARRY LOGIC; COMPUTER HARDWARE; FIELD PROGRAMMABLE GATE ARRAYS; MULTIPLYING CIRCUITS; PROGRAM PROCESSORS; THROUGHPUT;

CARRY SAVE ADDER (CSA); MODULAR EXPONENTIATION; MONTGOMERY MULTIPLICATION ALGORITHMS; RSA PROCESSORS;

CRYPTOGRAPHY;

EID: 21644431783     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. R.L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems", Communications of ACM, vol. 21:120-126, 1978
2. P.L. Montgomery, "Modular multiplication without trial division", Mathematics of computation, vol. 44:519-521, 1985
3. W. Diffie and M. E. Hellman, "New directions in cryptography", IEEE Transactions on information Theory, 22:644-654, November 1976
4. th conference on design of circuits and integrated systems, pages 680-685, Madrid, Spain, November 17-20 1998
5. th IEEE symp. on computer arithmetic, pp. 70-77, 1999
6. Ching-Chao, Tian-Sheuan Chang, and Chein-Wei Jen, "A new RSA cryptosystem hardware design based on montgomery's algorithm", IEEE transactions on circuits and systems, Vol. 45:908-912, 1998
7. Ciaran McIvor, Maire McLoone, John V McCanny, Alan Daly, William Marnane, "Fast montgomery modular multiplication and RSA cryptographic processor architectures", Department of electrical and electronic engineering, University college Cork, 2003
8. D. E. Knuth, "The art of computer programming: Seminumerical algorithms", Vol. 2. reading, MA: Addison-Wesley, Second edition, 1981
9. C. D. Walter, "Montgomery exponentiation needs no final subtractions", Electronics letters, 35(21): 1831-1832, October 1999
10. A. J. Elbirt, C. Paar, "Towards an FPGA architecture optimized for public-key algorithms", SPIE Symposium on voice, video and communications, September 1999
11. C. K. Koc, T. Acar, Burton S., Kaliski Jr., "Analyzing and comparing Montgomery multiplication algorithms", IEE micro, 16(3):26-33, June 1996
12. Jhing-Fa Wang, Po-Chuan Lin, Ping-Kun Chiu, "A staged carry-save-adder array for montgomery modular multiplication", Department of electrical engineering, National cheng kung university, 2000