On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation
Stéphane Ballet, Nicolas Baudru, Alexis Bonnecaze, Mila Tukumuli · Comptes Rendus Mathématique · 2017
The Chudnovsky algorithm for the multiplication in extensions of finite fields provides a bilinear complexity uniformly linear with respect to the degree of the extension. Recently, Randriambololona has generalized the method, allowing asymmetry in the interpolation procedure and leading to new upper bounds on the bilinear complexity. In this note, we describe the construction of this asymmetric method without derived evaluation. To do this, we translate this generalization into the language of algebraic function fields and we give a strategy of construction and implementation.