Sciweavers

Share
ISDA
2006
IEEE

Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis

11 years 5 months ago
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
- 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.
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where ISDA
Authors Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
Comments (0)
books