On the scalar complexity of Chudnovsky^2 multiplication algorithm in finite fields
From MaRDI portal
Publication:2175409
Recommendations
- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
- A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
- Chudnovsky-type algorithms over the projective line using generalized evaluation maps
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Finding optimal Chudnovsky-Chudnovsky multiplication algorithms
- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
- Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
- Chaining multiplications in finite fields with Chudnovsky-type algorithms and tensor rank of the \(k\)-multiplication
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
Cited in
(7)- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
- Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
- Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
This page was built for publication: On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175409)
