The Community for Technology Leaders
Green Image
Issue No. 07 - July (2010 vol. 59)
ISSN: 0018-9340
pp: 1007-1008
Gang Zhou , Technical University of Braunschweig, Braunschweig
Harald Michalik , Technical University of Braunschweig, Braunschweig
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.
Karatsuba algorithm, polynomial multiplication, finite field.

G. Zhou and H. Michalik, "Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"," in IEEE Transactions on Computers, vol. 59, no. , pp. 1007-1008, 2010.
94 ms
(Ver 3.3 (11022016))