Toom Cook

Toom Cook

      Toom–Cook, sometimes known as Toom-3, named after Andrei Toom, who introduced the new algorithm with its low complexity, and Stephen Cook, who cleaned the description of it, is a multiplication algorithm, a method of multiplying two large integers. In the present scientific computation like cryptography and many applications multiplication of two polynomials is very big concern. There are only few algorithms that advance efficiency through this large integer multiplication. Toom cook-3, Toom-cook-4 way and Karatsuba area the well known techniques that help in improving the efficiency in cryptosystems. In this paper we work on the classical Toom-k way of dealing with the multiplication of large integers.