loading...
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
Jinan, China October 16-October 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISDA.2006.138Sixth International Conference on Int ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Youbo Wang, Beijing Institute of Technology, China
Zhiguang Tian, Nanjing University of Aeronautics and Astronautics, China
Xinyan Bi, National University of Singapore, Singapore
Zhendong Niu, Beijing Institute of Technology, China
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.
Citation:
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu, "Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis," isda, vol. 1, pp.1132-1128, Sixth International Conference on Intelligent Systems Design and Applications (ISDA'06) Volume 1, 2006
Usage of this product signifies your acceptance of the Terms of Use.