Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms
From MaRDI portal
Publication:2949471
DOI10.1007/978-3-319-16277-5_3zbMath1400.11163MaRDI QIDQ2949471
Publication date: 1 October 2015
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16277-5_3
tensor rank; optimal algorithms; finite field arithmetic; elliptic modular curves; Chudnovsky-Chudnovsky interpolation
68Q25: Analysis of algorithms and problem complexity
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
11Y16: Number-theoretic algorithms; complexity
Related Items
On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry, Improved method for finding optimal formulas for bilinear maps in a finite field
Cites Work
- Unnamed Item
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
- Multiplication of polynomials modulo \(x^n\)
- Algebraic function fields and codes
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
- The Magma algebra system. I: The user language
- General tensor decomposition, moment matrices and applications
- Defining equations of modular curves
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
- Finding Optimal Formulae for Bilinear Maps
- Five, six, and seven-term Karatsuba-like formulae
- Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
- The M4RIE library for dense linear algebra over small fields with even characteristic
- Algebraic complexities and algebraic curves over finite fields
