Title :
Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"
Author :
Zhou, Gang ; Michalik, Harald
Author_Institution :
Inst. of Comput. & Network Eng., Tech. Univ. of Braunschweig, Braunschweig, Germany
fDate :
7/1/2010 12:00:00 AM
Abstract :
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.
Keywords :
computational complexity; logic gates; polynomials; Karatsuba polynomial multipliers; composite field; gate complexity; multiplier architecture; parallel finite field multiplier; Complexity theory; Computers; Delay; Gallium nitride; Galois fields; Logic gates; Polynomials; Karatsuba algorithm; finite field.; polynomial multiplication;
Journal_Title :
Computers, IEEE Transactions on
