Comment on “Subquadratic Space-Complexity Digit-Serial Multipliers Over GF(2^m) Using Generalized $(a, b)$-Way Karatsuba Algorithm”.

In the literature, the generalized $(a, b)$- way Karatsuba algorithm (KA) is a well-known high-precision technique for implementing a subquadratic digit-serial multiplication. We present here the corrections to the space and complexities pertaining to addition operations in $(a, b)$-way KA approach. [ABSTRACT FROM PUBLISHER]