Sciweavers

ANTS
2008
Springer

Faster Multiplication in GF(2)[x]

14 years 2 months ago
Faster Multiplication in GF(2)[x]
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, Sch
Richard P. Brent, Pierrick Gaudry, Emmanuel Thom&e
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where ANTS
Authors Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann
Comments (0)