One more paper on polynomials
18/06/2008
Added a paper “Improved n-term Karatsuba formulae in GF(2)” that contains improved (and without proof —- optimal!) formulae for multiplication of binary polynomials in GF(2). As noted in the end of this paper, the goal is not purely theoretic, but also practical —- these optimal formulae will be used for the superfast implementation of the Coppersmith algorithm (as in the work by Thome), where the key step is the multiplication of binary polynomials.
