On the scalar complexity of Chudnovsky multiplication algorithm in finite fields

We propose a new construction for the multiplication algorithm of D.V. and G.V. Chudnovsky in order to improve scalar algebraic complexity. In particular, we improve the Baum-Shokrollahi construction for multiplication in F256/F4 based on the elliptic Fermat curve x 3 + y 3 = 1.