Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)

DOI10.1016/j.laa.2008.06.004zbMath1153.15022OpenAlexW1999900513MaRDI QIDQ947669

Ivan V. Oseledets

Publication date: 6 October 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.06.004

zbMATH Keywords

optimal algorithmspolynomial multiplicationKaratsubatrilinear decomposition

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Multilinear algebra, tensor calculus (15A69)

Related Items (6)

The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms ⋮ A note on the paper ``Multiplication of polynomials modulo \(x^n\) by Murat Cenk and Ferruh Özbudak ⋮ Multiplication of polynomials modulo \(x^n\) ⋮ Improved method for finding optimal formulas for bilinear maps in a finite field ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gaussian elimination is not optimal
• Five, six, and seven-term Karatsuba-like formulae
• Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
• Optimal evaluation of pairs of bilinear forms

This page was built for publication: Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)