Comment on "Subquadratic Space-Complexity Digit-Serial Multipliers Over GF(2^) 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.

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems. I, Regular papers Regular papers, 2016-08, Vol.63 (8), p.1316-1319
Main Authors: Chiou-Yng Lee, Meher, Pramod Kumar
Format: Article
Language:English
Subjects:
Algorithms
b)-way KA
Circuits
Complexity
Computational complexity
Digit-serial multiplication
Elliptic curve cryptography
Galois fields
Multiplication
Multipliers
Multiplying circuits
subquadratic space-complexity
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1549-8328
1558-0806
DOI:10.1109/TCSI.2016.2568213