The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—It is well-known that a class of finite fields <tmath>$GF(2^n)$</tmath> using an optimal normal basis is most suitable for a hardware implementation of arithmetic in finite fields. In this paper, we introduce composite fields of some hardware-applicable properties resulting from the normal basis representation and the optimal condition. We also present a hardware architecture of the proposed composite fields including a bit-parallel multiplier.</p>
Finite field, composite field, optimal normal basis, bit-parallel multiplier.
Sangho Oh, Chang Han Kim, Jongin Lim, Dong Hyeon Cheon, "Efficient Normal Basis Multipliers in Composite Fields", IEEE Transactions on Computers, vol. 49, no. , pp. 1133-1138, October 2000, doi:10.1109/12.888054
82 ms
(Ver 3.3 (11022016))