arXiv · 2007.08203
Optimization of the scalar complexity of Chudnovsky$^2$ multiplication algorithms in finite fields
Abstract
We propose several constructions for the original multiplication algorithm of D.V. and G.V. Chudnovsky in order to improve its scalar complexity. We highlight the set of generic strategies who underlay the optimization of the scalar complexity, according to parameterizable criteria. As an example, we apply this analysis to the construction of type elliptic Chudnovsky$^2$ multiplication algorithms for small extensions. As a case study, we significantly improve the Baum-Shokrollahi construction for multiplication in $\mathbb F_{256}/\mathbb F_4$.
Explore related subjects
Keep this discovery
Stephane Ballet, Alexis Bonnecaze, Thanh-Hung Dang. 2020-07-16. Optimization of the scalar complexity of Chudnovsky$^2$ multiplication algorithms in finite fields. https://arxiv.org/abs/2007.08203
Cite the original work for its findings. Save a collection to share your selection of sources.