IMPLEMENTATION OF KARATSUBA ALGORITHM USING POLYNOMIAL MULTIPLICATION

Abstract Efficiency in multiplication is very important in applications like signal processing, cryptosystems and coding theory. This paper presents the design of a fast multiplier using the Karatsuba algorithm to multiply two numbers using the technique of polynomial multiplication. The Karatsuba algorithm saves coefficient multiplications at the cost of extra additions as compared to the ordinary multiplication method. The Karatsuba algorithm is more efficient for multiplication of large numbers.

[1]  Qiang Wang,et al.  A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form , 2010, IEEE Transactions on Computers.

[2]  Joachim von zur Gathen,et al.  Efficient FPGA-Based Karatsuba Multipliers for Polynomials over F2 , 2005, Selected Areas in Cryptography.

[3]  Chester Rebeiro,et al.  Power Attack Resistant Efficient FPGA Architecture for Karatsuba Multiplier , 2008, 21st International Conference on VLSI Design (VLSID 2008).

[4]  Dhiraj K. Pradhan,et al.  A Routing-Aware ILS Design Technique , 2011, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[5]  Christof Paar,et al.  Generalizations of the Karatsuba Algorithm for Efficient Implementations , 2006, IACR Cryptol. ePrint Arch..

[6]  Peter L. Montgomery,et al.  Five, six, and seven-term Karatsuba-like formulae , 2005, IEEE Transactions on Computers.

[7]  Gang Zhou,et al.  Complexity Analysis and Efficient Implementations of Bit Parallel Finite Field Multipliers Based on Karatsuba-Ofman Algorithm on FPGAs , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Çetin Kaya Koç,et al.  A less recursive variant of Karatsuba-Ofman algorithm for multiplying operands of size a power of two , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.