Finding Optimal Formulae for Bilinear Maps

DOI10.1007/978-3-642-31662-3_12zbMath1293.68310OpenAlexW137814691MaRDI QIDQ3166980

Nicolas Estibals, Jérémie Detrey, Paul Zimmermann, Razvan Barbulescu

Publication date: 1 November 2012

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31662-3_12

zbMATH Keywords

tensor rankbilinear mapoptimal algorithmsfinite field arithmeticbilinear rankpolynomial multiplication and squaring

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (7)

The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms ⋮ Trisymmetric multiplication formulae in finite fields ⋮ 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 ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry ⋮ On the arithmetic operations over finite fields of characteristic three with low complexity

This page was built for publication: Finding Optimal Formulae for Bilinear Maps