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

DOI10.1016/J.CRMA.2017.06.002MaRDI QIDQ2012337zbMATH OpenOpenAlexFDO

Authors S. Ballet, Nicolas Baudru, Alexis Bonnecaze, Mila Tukumuli

Publication date 31 July 2017

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

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

Recommendations

• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
• An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
• Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
• Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
• Chudnovsky-type algorithms over the projective line using generalized evaluation maps

Cites work

• scientific article; zbMATH DE number 125907 (Why is no real title available?)
• scientific article; zbMATH DE number 2231494 (Why is no real title available?)
• Algebraic complexities and algebraic curves over finite fields
• Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields

Cited in

(4)

• A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
• Chudnovsky-type algorithms over the projective line using generalized evaluation maps
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry

This page was built for publication: On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012337)