Exploring the design-space for FPGA-based implementation of RSA

Microprocessors and Microsystems

Volumn 28, Issue 4, 2004, Pages 183-191

  Cilardo, A ^a   Mazzeo, A ^a   Romano, L ^a   Saggese, G P ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

Field programmable gate arrays; Montgomery multiplication; Reconfigurable computing; Rivest Shamir Adleman cryptosystem

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER HARDWARE; LOGIC DESIGN; NUMBER THEORY; PARAMETER ESTIMATION; PUBLIC KEY CRYPTOGRAPHY;

E-BANKING; EXECUTION TIME; RECONFIGURABLE COMPUTING; SERIALIZATION;

FIELD PROGRAMMABLE GATE ARRAYS;

EID: 2142813016     PISSN: 01419331     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.micpro.2004.03.009     Document Type: Article

References (17)

1. Menezes A., van Oorschot P., Vanstone S. Handbook of Applied Cryptography. 1996;CRC Press, Boca Raton.
2. Rivest R.L., Shamir A., Adleman L. A method for obtaining digital signature and public-key cryptosystems. Commun. ACM. 21:1978;120-126.
3. Elbirt A.J., Yip W., Chetwynd B., Paar C. An FPGA-based performance evaluation of the AES block cipher candidate algorithm finalists. IEEE Trans. VLSI Syst. 9:2001;545-556.
4. Ç.K. Koç, High-speed RSA implementation, Technical Report TR 201, RSA Laboratories, 1994.
5. Knuth D.E. The Art of Computer Programming: Seminumerical Algorithms. vol. 2:1981;Addison-Wesley, Reading, MA.
6. Blakley G.R. A computer algorithm for calculating the product AB modulo M. IEEE Trans. Comput. 32:1983;497-500.
7. Montgomery P.L. Modular multiplication without trial division. Math. Comput. 44:1985;519-521.
8. Ç.K. Koç, RSA hardware implementation, Technical Report TR801, RSA Laboratories, 1995.
9. Mazzeo A., Mazzocca N., Romano L., Saggese G.P. FPGA-based implementation of a serial RSA processor. in: Proceedings of the Design and Test Europe (DATE) Conference. 2003;. pp. 582-587.
10. A. Cilardo, Modular exponentiation on reconfigurable hardware, Master Thesis, 2003, available at http://cds.unina.it/~acilardo .
11. Eldridge S.E., Walter C.D. Hardware implementation of Montgomery's modular multiplication algorithm. IEEE Trans. Comput. 42:1993;693-699.
12. Blum T., Paar C. Montgomery modular exponentiation on reconfigurable hardware. in: Proceedings of 14th Symposium on Computer Arithmetic. 1999;. pp. 70-77.
13. Walter C.D. Montgomery exponentiation needs no final subtraction. IEE Electron. Lett. 35:1999;1831-1832.
14. Daly A., Marnane W. Efficient architectures for implementing Montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic. in: Proceedings of the 10th ACM/SIGDA International Symposium on Field Programmable Gate Arrays. 2002;. pp. 40-49.
15. McIvor C., McLoone M., McCanny J., Daly A., Marnane W. Fast Montgomery modular multiplication and RSA cryptographic processor architectures. in: Proceedings of Asilomar Conference on Signals, Systems and Computers. 2003.
16. Quisquarter J., Couvreur C. Fast decipherment algorithm for RSA public-key cryptosystem. Electron. Lett. 18:1982;905-907.
17. A. Cilardo, G.P. Saggese, A. Mazzeo, L. Romano. Carry-Save Montgomery Modular Exponentiation on Reconfigurable Hardware, in IEEE Proc. of Design, Automation and Test in Europe Conference, 2004 (DATE04), vol. 3, pp. 206-211, February 2004.