DocumentCode
458939
Title
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
Author
Wang, Youbo ; Tian, Zhiguang ; Bi, Xinyan ; Niu, Zhendong
Author_Institution
Dept. of Comput. Sci. & Eng., Beijing Inst. of Technol.
Volume
1
fYear
2006
fDate
16-18 Oct. 2006
Firstpage
1132
Lastpage
1128
Abstract
Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation part. In this paper, an efficient tradeoff multiplier implementation between full parallel and full serial multiplier is proposed based on optimal normal basis of type II and shifted canonical basis. Experiments show that the multiplier is suitable to realize in FPGA device
Keywords
multiplying circuits; public key cryptography; bit parallel multiplier; bit serial multiplier; elliptic curve cryptography; finite field; modular multiplication arithmetic; type II optimal normal basis; Bismuth; Computer science; Educational institutions; Elliptic curve cryptography; Elliptic curves; Field programmable gate arrays; Galois fields; Public key; Public key cryptography; Space technology;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems Design and Applications, 2006. ISDA '06. Sixth International Conference on
Conference_Location
Jinan
Print_ISBN
0-7695-2528-8
Type
conf
DOI
10.1109/ISDA.2006.138
Filename
4021598
Link To Document