On Chudnovsky-Based Arithmetic Algorithms in Finite Fields
Discrete Mathematics
2015-10-02 v1 Algebraic Geometry
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 .
Keywords
Cite
@article{arxiv.1510.00090,
title = {On Chudnovsky-Based Arithmetic Algorithms in Finite Fields},
author = {Kevin Atighehchi and Stéphane Ballet and Alexis Bonnecaze and Robert Rolland},
journal= {arXiv preprint arXiv:1510.00090},
year = {2015}
}