On Chudnovsky-Based Arithmetic Algorithms in Finite Fields

MaRDI QIDQ6265991zbMATH OpenFDO

Authors Kévin Atighehchi, S. Ballet, Alexis Bonnecaze, Robert Rolland

Publication date 30 September 2015

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Curves over finite and local fields (11G20) Algebraic geometry (14-XX)

Abstract: 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 ${mathbbF}_{16^{13}}$.

This page was built for publication: On Chudnovsky-Based Arithmetic Algorithms in Finite Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6265991)