sign in
english version rss feed

inria-00188261, version 4

Faster Multiplication in GF(2)[x]

Richard P. Brent a1, Pierrick Gaudry () 2, Emmanuel Thomé () 2, Paul Zimmermann () 2

ANTS-VIII 5011 (2008) 153-166

Abstract: In this paper, we discuss an implementation of various algorithms for multiplying polynomials in GF(2)[x]: variants of the window methods, Karatsuba's, Toom-Cook's, Schoenhage's and Cantor's algorithms. For most of them, we propose improvements that lead to practical speedups.

 
  • inria-00188261, version 4
  • oai:hal.inria.fr:inria-00188261
  • From: 
  • Submitted on: Friday, 7 November 2008 08:33:25
  • Updated on: Thursday, 13 November 2008 21:49:38
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...