On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation

Résumé

The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provides a bilinear complexity which is uniformly linear whith 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. We describe the effective algorithm of this asymmetric method, without derivated evaluation. Finally, we give examples with the finite field $\F_{16^{13}}$ using only rational places, $\F_{4^{13}}$ using also places of degree two and $\F_{2^{13}}$ using also places of degree four.

Dates et versions

hal-01478942 , version 1 (28-02-2017)

Identifiants

Citer

Stéphane Ballet, Nicolas Baudru, Alexis Bonnecaze, Mila Tukumuli. On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation. 2016. ⟨hal-01478942⟩
96 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More