Trisymmetric Multiplication Formulae in Finite Fields - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Trisymmetric Multiplication Formulae in Finite Fields

(1, 2) , (3)
1
2
3

Abstract

Multiplication is an expensive arithmetic operation, therefore there has been extensive research to find Karatsuba-like formulae reducing the number of multiplications involved when computing a bilinear map. The minimal number of multiplications in such formulae is called the bilinear complexity, and it is also of theoretical interest to asymptotically understand it. Moreover, when the bilinear maps admit some kind of invariance, it is also desirable to find formulae keeping the same invariance. In this work, we study trisymmetric, hypersymmetric, and Galois invariant multiplication formulae over finite fields, and we give an algorithm to find such formulae. We also generalize the result that the bilinear complexity and symmetric bilinear complexity of the twovariable multiplication in an extension field are linear in the degree of the extension, to trisymmetric bilinear complexity, and to the complexity of t-variable multiplication for any t ≥ 3.
Fichier principal
Vignette du fichier
tri-sym.pdf (514.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03832419 , version 1 (27-10-2022)

Identifiers

Cite

Hugues Randriambololona, Édouard Rousseau. Trisymmetric Multiplication Formulae in Finite Fields. WAIFI 2020, Jul 2020, Rennes, France. pp.92-111, ⟨10.1007/978-3-030-68869-1_5⟩. ⟨hal-03832419⟩
0 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More