https://telecom-paris.hal.science/hal-03832419Randriambololona, HuguesHuguesRandriambololonaLCR - Laboratoire de cryptographie de l'ANSSI - ANSSI - Agence nationale de la sécurité des systèmes d'informationC2 - Cybersécurité et Cryptographie - LTCI - Laboratoire Traitement et Communication de l'Information - IMT - Institut Mines-Télécom [Paris] - Télécom ParisRousseau, ÉdouardÉdouardRousseauUVSQ - Université de Versailles Saint-Quentin-en-YvelinesTrisymmetric Multiplication Formulae in Finite FieldsHAL CCSD2021[INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC][MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT][INFO.INFO-AO] Computer Science [cs]/Computer Arithmetic[INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]RANDRIAM, Hugues2022-10-27 16:34:112023-02-28 15:36:252022-11-02 08:51:51enConference papershttps://telecom-paris.hal.science/hal-03832419/document10.1007/978-3-030-68869-1_5application/pdf1Multiplication 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.