Improved polynomial multiplication formulas over F2 using Chinese remainder theorem

IEEE Transactions on Computers

Volumn 58, Issue 4, 2009, Pages 572-576

  Cenk, Murat ^a   Özbudak, Ferruh ^b  

^a CANKAYA UNIVERSITY   (Turkey)

^b MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Chinese remainder theorem; Finite field polynomial multiplication

Indexed keywords

CHINESE REMAINDER THEOREM; FINITE FIELD POLYNOMIAL MULTIPLICATION; IRREDUCIBLE POLYNOMIALS; MULTIPLICATION COMPLEXITY; POSITIVE INTEGERS; UPPER BOUNDS;

POLYNOMIAL APPROXIMATION;

EID: 63049100179     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2008.207     Document Type: Article

References (6)

1. H. Fan and M.A. Hasan, "Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae," IEEE Trans. Computers, vol. 56, no. 5, pp. 716-717, May 2007.
2. A. Karatsuba and Y. Ofman, "Multiplication of Multidigit Numbers by Automata," Soviet Physics - Doklady, vol. 7, pp. 595-596, 1963.
3. P.L. Montgomery, "Five, Six, and Seven-Term Karatsuba-Like Formulae," IEEE Trans. Computers, vol. 54, no. 3, pp. 362-369, Mar. 2005.
4. k) Multipliers," IEEE Trans. Computers vol. 53, no. 9, pp. 1097-1105, Sept. 2004.
5. A. Weimerskirch and C. Paar, Generalizations of the Karatsuba Algorithm for Polynomial Multiplication, http://eprint.iacr.org/2006/ 224, 2008.
6. S. Winograd, Arithmetic Complexity of Computations. SIAM, 1980.