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.

[全文传递流程]：

一般上传文献全文的时限在1个工作日内