DocumentCode
1753909
Title
Hardware implementation of arithmetic for elliptic curve cryptosystems over GF(2m)
Author
Amara, Moncef ; Siad, Amar
Author_Institution
LAGA Lab., Univ. of Paris 8, St. Denis, France
fYear
2011
fDate
21-23 Feb. 2011
Firstpage
73
Lastpage
78
Abstract
The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. In the present work, we develop a design of elliptic curve operations over binary Fields GF(2m). The function used for this purpose is the scalar multiplication kP which is the core operation of ECCs. Where k is an integer and P is a point on an elliptic curve. The EC Point multiplication processor defined in affine coordinates is achieved by using a dedicated Galois Field arithmetic implemented on FPGA using VHDL language.
Keywords
Galois fields; digital arithmetic; field programmable gate arrays; hardware description languages; public key cryptography; EC point multiplication processor; FPGA; VHDL language; binary fields; dedicated Galois field arithmetic; elliptic curve cryptography; scalar multiplication; Digital signatures; Elliptic curve cryptography; Elliptic curves; Polynomials; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Internet Security (WorldCIS), 2011 World Congress on
Conference_Location
London
Print_ISBN
978-1-4244-8879-7
Electronic_ISBN
978-0-9564263-7-6
Type
conf
Filename
5749886
Link To Document