On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation

DOI10.1016/j.crma.2017.06.002zbMath1367.11090OpenAlexW2625324095MaRDI QIDQ2012337

Stéphane Ballet, Mila Tukumuli, Alexis Bonnecaze, Nicolas Baudru

Publication date: 31 July 2017

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2017.06.002

zbMATH Keywords

tensor rankbilinear complexityChudnovsky algorithm

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Number-theoretic algorithms; complexity (11Y16) Finite fields (field-theoretic aspects) (12E20)

Related Items

On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
• New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
• Algebraic complexities and algebraic curves over finite fields