Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematics of Computation Année : 2017

Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm

Résumé

Thanks to a new construction of the so-called Chudnovsky-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. We give an example with the finite field ${\mathbb F}_{16^{13}}$.

Dates et versions

hal-01491790 , version 1 (17-03-2017)

Identifiants

Citer

Kevin Atighehchi, Stéphane Ballet, Alexis Bonnecaze, Robert Rolland. Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm. Mathematics of Computation, 2017, 86 (308), pp.2975 - 3000. ⟨10.1090/mcom/3230⟩. ⟨hal-01491790⟩
304 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More