Skip to Main content Skip to Navigation
Reports

Faster Multiplication in GF(2)[x]

Richard Brent 1 Pierrick Gaudry 2 Emmanuel Thomé 2 Paul Zimmermann 2
2 CACAO - Curves, Algebra, Computer Arithmetic, and so On
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Complete list of metadata

https://hal.inria.fr/inria-00188261
Contributor : Paul Zimmermann <>
Submitted on : Friday, November 16, 2007 - 11:09:53 AM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM
Long-term archiving on: : Monday, April 12, 2010 - 2:24:49 AM

File

mulgf2-rr.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00188261, version 1

Citation

Richard Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann. Faster Multiplication in GF(2)[x]. [Research Report] 2007. ⟨inria-00188261v1⟩

Share

Metrics

Record views

44

Files downloads

324