Skip navigation
Skip navigation

Faster Multiplication in GF(2)[x]

Brent, Richard; Gaudry, Pierrick; Zimmermann, Paul

Description

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 pract

CollectionsANU Research Publications
Date published: 2008
Type: Conference paper
URI: http://hdl.handle.net/1885/22722
Source: Lecture Notes in Computer Science
DOI: 10.1007/978-3-540-79456-1_10

Download

File Description SizeFormat Image
01_Brent_Faster_Multiplication_in_2008.pdf513.37 kBAdobe PDF    Request a copy
02_Brent_Faster_Multiplication_in_2008.pdf199.62 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator