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: Polynomial multiplication performs as the most important task and is computationally extensive in cryptographic algorithms. Of the several polynomial multiplications, theoretically, the Toom ...

Double Paper Update: Our research paper "A Comparative Analysis between Karatsuba, Toom-Cook and NTT Multiplier for Polynomial Multiplication in NTRU on FPGA" got accepted into the Asian Hardware ...

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

Actually Toom-Cook is a family of algorithms: the reported complexity is only one particular case (Toom-Cook-3), but many more exist (even unbalanced ones).

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.