Abstract: Polynomial multiplication performs as the most important task and is computationally extensive in cryptographic algorithms. Of the several polynomial multiplications, theoretically, the Toom ...

smaller Fermat numbers and extremely large B2, when Karatsuba and Toom-Cook are used extensively.) Factoring Fermat numbers uses a lot of memory, depending on the size of the Fermat number and on dF.