Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity
From MaRDI portal
Publication:6113915
DOI10.1007/978-3-031-22944-2_3zbMath1529.11128OpenAlexW4314937957MaRDI QIDQ6113915
Stéphane Ballet, Bastien Pacifico, Alexis Bonnecaze
Publication date: 10 August 2023
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22944-2_3
Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Computational methods for problems pertaining to field theory (12-08)
Related Items (2)
Chudnovsky-type algorithms over the projective line using generalized evaluation maps ⋮ Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- On multiplication in finite fields
- Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\)
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- On the tensor rank of multiplication in any extension of \(\mathbb F_2\)
- Fast multiplication of large numbers
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- Algebraic complexities and algebraic curves over finite fields
- Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity
This page was built for publication: Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity
