Tradeoff analysis of FPGA based elliptic curve cryptography

Author

Bednara, M. ; Daldrup, M. ; Teich, J. ; von zur Gathen, J. ; Shokrollahi, J.

Author_Institution

Comput. Eng. Lab., Paderborn Univ., Germany

Volume

5

fYear

2002

fDate

2002

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.

Keywords

coprocessors; elliptic equations; field programmable gate arrays; integrated circuit design; integrated circuit modelling; logic CAD; multiplying circuits; public key cryptography; table lookup; FPGA based elliptic curve cryptography; Montgomery algorithm; critical cryptography operations; curve coordinate representations; curve multiplication; elliptic curve coprocessor; field multiplication; field multiplier efficiency; generic coprocessor architecture; implementation tradeoff analysis; lookup tables; public key crypto systems; required field operation number; Algorithm design and analysis; Arithmetic; Coprocessors; Elliptic curve cryptography; Elliptic curves; Field programmable gate arrays; Galois fields; Hardware; Performance analysis; Public key cryptography;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on

Print_ISBN

0-7803-7448-7

Type

conf

DOI

10.1109/ISCAS.2002.1010824

Filename

1010824