TY - GEN
T1 - Faster multiplication in GF(2)[x]
AU - Brent, Richard P.
AU - Gaudry, Pierrick
AU - Thomé, Emmanuel
AU - Zimmermann, Paul
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=44649181260&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-79456-1_10
DO - 10.1007/978-3-540-79456-1_10
M3 - Conference contribution
SN - 3540794557
SN - 9783540794554
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 153
EP - 166
BT - Algorithmic Number Theory - 8th International Symposium, ANTS-VIII, Proceedings
T2 - 8th International Symposium on Algorithmic Number Theory, ANTS-VIII
Y2 - 17 May 2008 through 22 May 2008
ER -