Low complexity parallel multiplier in F(q/sup n/) over F/sub q/

In this brief, parallel multiplication in F(q/sup n/) over F/sub q/, where q can be a prime power, is considered. A closed form proof has been given for the size complexity bound of the parallel multiplier. Implementation with reduced propagation delay has been shown with an example. Basis conversion between the weakly dual basis and the polynomial basis has also been discussed.