Research Article
Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications
Table 1
Comparison of the well-known polynomial multiplication algorithms.
| Multiplication algorithm | Technique | Representation | Complexity | Divide and conquer | Point evaluation | Interpolation |
| Classical | — | — | — | Coefficient representation | | Karatsuba | √ | — | — | Coefficient representation | | Toom-Cook | √ | √ | √ | Point-value representation | | FFT | √ | √ | √ | Point-value representation | |
|
|