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, Schoenhage's and Cantor's algorithms. For most of them, we propose improvements that lead to practical speedups.
| Origin | Publisher files allowed on an open archive |
|---|
Loading...