Effective Arithmetic in Finite Fields Based on Chudnovsky’s Multiplication Algorithm

Abstract

Thanks to a new construction of the Chudnovsky and Chudnovsky multiplication algorithm, we design efficient algorithms for both the exponentiation and the multiplication in finite fields. They are tailored to hardware implementation and they allow computations to be parallelized, while maintaining a low number of bilinear multiplications.

Publication
In Comptes Rendus de l’Académie des Sciences (C. R. Math.), Elsevier
Date
Links