Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm
DOI10.1016/J.CRMA.2015.12.001zbMATH Open1429.12001OpenAlexW2274994815MaRDI QIDQ512336FDOQ512336
Robert Rolland, S. Ballet, Kévin Atighehchi, Alexis Bonnecaze
Publication date: 24 February 2017
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.crma.2015.12.001
Recommendations
- Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
- An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
- On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields
- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
Symbolic computation and algebraic computation (68W30) Finite fields (field-theoretic aspects) (12E20) Field arithmetic (12E30) Computational methods for problems pertaining to field theory (12-08)
Cites Work
- Matrix multiplication via arithmetic progressions
- Algebraic complexities and algebraic curves over finite fields
- Algorithms for exponentiation in finite fields
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
- Elliptic periods for finite fields
- Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
- Efficient and optimal exponentiation in finite fields
Cited In (3)
This page was built for publication: Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512336)
