In this paper, a Toom-Cook Multiplication algorithm is theoretically one of the efficient when
compare to that of traditionally used Schoolbook and Karatsuba Multiplication
Toom-Cook Multiplication is a theoretically more efficient multiplication algorithm than traditionally used Karatsuba and Schoolbook Multiplication but is rarely used in practical hardware designs due to its inherent exact divisions, which are time-consuming and difficult for parallel and serial acceleration. This paper proposes a method of division free Toom-Cook Multiplication based Montgomery Modular Multiplication, which makes it possible for Toom-Cook multiplication to be applied in practical and efficient hardware implementations. We also provide a hardware implementation of modular multipliers of 256 bits and 1024 bits with advantages on area-time-product over previous researches.