Abstract
We design a class of Chudnovsky-type algorithms multiplying k elements of a finite extension \({\text {I}\!\text {F}}_{q^n}\) of a finite field \({\text {I}\!\text {F}}_q\), where \(k\ge 2\). We prove that these algorithms give a tensor decomposition of the k-multiplication for which the rank is in O(n) uniformly in q. We give uniform upper bounds of the rank of k-multiplication in finite fields. They use interpolation on algebraic curves which transforms the problem in computing the Hadamard product of k vectors with components in \({\text {I}\!\text {F}}_q\). This generalization of the widely studied case of \(k=2\) is based on a modification of the Riemann-Roch spaces involved and the use of towers of function fields having a lot of places of high degree.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ballet, S., Le Brigand, D.: On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_q\). J. Number Theory 116, 293–310 (2006)
Ballet, S., Le Brigand, D., Rolland, R.: On an application of the definition field descent of a tower of function fields. In: Proceedings of the Conference Arithmetic, Geometry and Coding Theory (AGCT 2005), vol. 21, pp. 187–203. Société Mathématique de France, sér. Séminaires et Congrès (2009)
Ballet, S., Pieltant, J.: Tower of algebraic function fields with maximal Hasse-Witt invariant and tensor rank of multiplication in any extension of \(\mathbb{F} _2\) and \(\mathbb{F} _3\). J. Pure Appl. Algebra 222(5), 1069–1086 (2018)
Ballet, S., Pieltant, J., Rambaud, M., Randriambololona, H., Rolland, R., Chaumine, J.: On the tensor rank of multiplication in finite extension of finite fields and related issues in algebraic geometry. Uspekhi Mat. Nauk 76, 31–94 (2021)
Ballet, S., Ritzenthaler, C., Rolland, R.: On the existence of dimension zero divisors in algebraic function fields defined over \(\mathbb{F} _q\). Acta Arith. 143(4), 377–392 (2010)
Ballet, S., Rolland, R.: Families of curves over any finite field attaining the generalized Drinfeld-Vlăduţ bound. Publications Mathématiques de Besançon, Algèbre et Théorie des Nombres, pp. 5–18 (2011)
Bshouty, N.: Multilinear complexity is equivalent to optimal tester size. In: Electronic Colloquium on Computational Complexity (ECCC), Tr13(11) (2013)
Deuring, M.: Lectures on the Theory of Algebraic Functions of One Variable. Springer, Heidelberg (1973). https://doi.org/10.1007/BFb0060944
Garcia, A., Stichtenoth, H., Ruck, H.-G.: On tame towers over finite fields. Journal für die reine und angewandte Mathematik 557, 53–80 (2003)
Randriambololona, H., Rousseau, É.: Trisymmetric multiplication formulae in finite fields. In: Bajard, J.C., Topuzoğlu, A. (eds.) WAIFI 2020. LNCS, vol. 12542, pp. 92–111. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-68869-1_5
Rousseau, E.: ArithmÃtique efficace des extensions de corps finis. Ph.D. thesis, Institut Polytechnique de Paris (2021)
Shparlinski, I.E., Tsfasman, M.A., Vladut, S.G.: Curves with many points and multiplication in finite fileds. In: Stichtenoth, H., Tsfasman, M.A. (eds.) Coding Theory and Algebraic Geometry. LNM, vol. 1518, pp. 145–169. Springer, Heidelberg (1992). https://doi.org/10.1007/BFb0087999
Stichtenoth, H.: Algebraic Function Fields and Codes. Graduate Texts in Mathematics, vol. 254. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-76878-4
Acknowledgement
We would like to thank the referees for their valuable comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ballet, S., Rolland, R. (2022). Chaining Multiplications in Finite Fields with Chudnovsky-Type Algorithms and Tensor Rank of the k-Multiplication. In: Poulakis, D., Rahonis, G. (eds) Algebraic Informatics. CAI 2022. Lecture Notes in Computer Science, vol 13706. Springer, Cham. https://doi.org/10.1007/978-3-031-19685-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-19685-0_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-19684-3
Online ISBN: 978-3-031-19685-0
eBook Packages: Computer ScienceComputer Science (R0)