Efficient normal basis multipliers in composite fields

It is well-known that a class of finite fields GF(2(n)) using an optimal no rmal basis is most suitable for a hardware implementation of arithmetic in finite fields. In this paper, we introduce composite fields of some hardwar e-applicable properties resulting from the normal basis representation and the optimal condition. We also present a hardware architecture of the propo sed composite fields including a hit-parallel multiplier.