Tradeoff Analysis of FPGA Based Elliptic Curve Cryptography

Bednara M, Daldrup M, J. Shokrollahi J, Teich J, von zur Gathen J (2002)


Publication Type: Conference contribution

Publication year: 2002

Journal

Publisher: Institute of Electrical and Electronics Engineers

Edited Volumes: Proceedings - IEEE International Symposium on Circuits and Systems

Conference Proceedings Title: Proc. of IEEE International Symposium on Circuits and Systems

Event location: Scottsdale, Arizona US

Abstract

FPGAs are an attractive platform for elliptic curve cryptography hardware. Since field multiplication is the most critical operation in elliptic curve cryptography, we have studied how efficient several field multipliers can be mapped to lookup table based FPGAs. Furthermore we have compared different curve coordinate representations with respect to the number of required field operations, and show how an elliptic curve coprocessor based on the Montgomery algorithm for curve multiplication can be implemented using our generic coprocessor architecture.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Bednara, M., Daldrup, M., J. Shokrollahi, J., Teich, J., & von zur Gathen, J. (2002). Tradeoff Analysis of FPGA Based Elliptic Curve Cryptography. In Proc. of IEEE International Symposium on Circuits and Systems. Scottsdale, Arizona, US: Institute of Electrical and Electronics Engineers.

MLA:

Bednara, Marcus, et al. "Tradeoff Analysis of FPGA Based Elliptic Curve Cryptography." Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS-02),, Scottsdale, Arizona Institute of Electrical and Electronics Engineers, 2002.

BibTeX: Download