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