Tradeoff Analysis of FPGA Based Elliptic Curve Cryptography

Beitrag bei einer Tagung


Details zur Publikation

Autor(en): Bednara M, Daldrup M, J. Shokrollahi J, Teich J, von zur Gathen J
Titel Sammelwerk: Proceedings - IEEE International Symposium on Circuits and Systems
Verlag: Institute of Electrical and Electronics Engineers
Jahr der Veröffentlichung: 2002
Tagungsband: Proc. of IEEE International Symposium on Circuits and Systems
ISSN: 0271-4310


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.



FAU-Autoren / FAU-Herausgeber

Teich, Jürgen Prof. Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)


Autor(en) der externen Einrichtung(en)
Universität Paderborn


Zitierweisen

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: 

Zuletzt aktualisiert 2018-08-08 um 00:11