Abstract: The Cook-Toom algorithm is widely used in short-length linear convolution, which is the building block of large points convolution algorithms. This paper proposes improved parallel finite ...

Abstract: The Toom-Cook multiplier (TCM) is the most suitable method for multiplying large integers with key widths typically employed in ECC or RSA due to its computational efficiency. In this brief, ...

ABSTRACT: Several algorithms based on homogeneous polynomials for multiplication of large integers are described in the paper. The homogeneity of polynomials provides several simplifications: ...

ABSTRACT: Several algorithms based on homogeneous polynomials for multiplication of large integers are described in the paper. The homogeneity of polynomials provides several simplifications: ...