Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
From MaRDI portal
Recommendations
- 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
- An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
- On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields
Cites work
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Algebraic complexities and algebraic curves over finite fields
- Algebraic function fields and codes
- Algorithms for exponentiation in finite fields
- An improved parallel algorithm that computes the BFS numbering of a directed graph
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
- Efficient and optimal exponentiation in finite fields
- Efficient parallel exponentiation in using normal basis representations
- Elliptic periods for finite fields
- scientific article; zbMATH DE number 5896947 (Why is no real title available?)
- scientific article; zbMATH DE number 1142301 (Why is no real title available?)
- scientific article; zbMATH DE number 1406771 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Matrix multiplication via arithmetic progressions
- Multiplication algorithm in a finite field and tensor rank of the multiplication.
- On multiplication in finite fields
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
- On the existence of dimension zero divisors in algebraic function fields defined over F_q
- On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_2\)
- On the tensor rank of multiplication in any extension of \(\mathbb F_2\)
- Processor-efficient exponentiation in finite fields
- Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15
- The Magma algebra system. I: The user language
Cited in
(8)- Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields
- Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
- Normal bases from 1-dimensional algebraic groups
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
- Dense Arithmetic over Finite Fields with the CUMODP Library
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm
- On arithmetical algorithms over finite fields
This page was built for publication: Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270844)
