DocumentCode
2549557
Title
A scalable architecture for elliptic curve point multiplication
Author
Järvinen, Kimmo ; Tommiska, Matti ; Skyttä, Jorma
Author_Institution
Signal Process. Lab., Helsinki Univ. of Technol., Otakaari, Finland
fYear
2004
fDate
6-8 Dec. 2004
Firstpage
303
Lastpage
306
Abstract
An architecture for elliptic curve point multiplication, which is developed especially for FPGAs, is introduced. The point multiplication is the basic operation of any elliptic curve cryptosystem and, hence, it must be implemented efficiently. The architecture is designed to be flexible in terms of speed and logic requirements and it can be scaled to meet the demands of different applications. Implementations have proven to be very efficient in performance and they belong to the fastest published FPGA-based ECC designs for most elliptic curve parameters.
Keywords
cryptography; field programmable gate arrays; integrated circuit design; logic design; multiplying circuits; FPGA-based ECC designs; elliptic curve cryptosystem; elliptic curve point multiplication; field programmable gate arrays; logic requirements; scalable architecture; Arithmetic; Elliptic curve cryptography; Elliptic curves; Field programmable gate arrays; Galois fields; Laboratories; Logic design; Polynomials; Process control; Signal processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Field-Programmable Technology, 2004. Proceedings. 2004 IEEE International Conference on
Print_ISBN
0-7803-8651-5
Type
conf
DOI
10.1109/FPT.2004.1393285
Filename
1393285
Link To Document