Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"

In this comment, we show that the gate complexity of Karatsuba polynomial multipliers presented in the above paper can be reduced by exploring the common subexpressions.