Abstract
In this paper, we discuss an implementation of various algorithms for multiplying polynomials in : variants of the window methods, Karatsuba's, Toom-Cook's, Schönhage's and Cantor's algorithms. For most of them, we propose improvements that lead to practical speedups. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
APA
Brent, R. P., Gaudry, P., Thomé, E., & Zimmermann, P. (2008). Faster multiplication in GF(2)[x]. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5011 LNCS, pp. 153–166). https://doi.org/10.1007/978-3-540-79456-1_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free