DocumentCode
412927
Title
An reconfigurable multiplier in GF(2m) for elliptic curve cryptosystem
Author
Kitsos, P. ; Theodoridis, G. ; Koufopavlou, O.
Author_Institution
Electr. & Comput. Eng. Dept., Patras Univ., Greece
Volume
2
fYear
2003
fDate
14-17 Dec. 2003
Firstpage
699
Abstract
In this paper an efficient architecture of a reconfigurable bit-serial polynomial basis multiplier for Galois field GF(2m), where 12) multipliers.
Keywords
Galois fields; computational complexity; cryptography; field programmable gate arrays; multiplying circuits; polynomials; reconfigurable architectures; shift registers; FPGA; Galois field; arbitrary field degree; elliptic curve cryptosystem; high order of flexibility; irreducible polynomial; linear feedback shift register; low hardware complexity; reconfigurable bit-serial polynomial basis multiplier; Computer architecture; Design engineering; Electronic mail; Elliptic curve cryptography; Galois fields; Hardware; Laboratories; Physics computing; Polynomials; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics, Circuits and Systems, 2003. ICECS 2003. Proceedings of the 2003 10th IEEE International Conference on
Print_ISBN
0-7803-8163-7
Type
conf
DOI
10.1109/ICECS.2003.1301881
Filename
1301881
Link To Document