An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields

DOI10.1016/j.tcs.2005.11.045zbMath1099.11073OpenAlexW2068589874MaRDI QIDQ818142

Stéphane Ballet

Publication date: 24 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.045

zbMATH Keywords

algorithmsfinite fieldsalgebraic curvesalgebraic function fieldsbilinear complexity

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (6)

Normal bases from 1-dimensional algebraic groups ⋮ On the tensor rank of the multiplication in the finite fields ⋮ On multiplication in finite fields ⋮ On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields ⋮ Elliptic periods for finite fields ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_2\)
• An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
• On multiplication in algebraic extension fields
• Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\)
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15
• On the bounds of the bilinear complexity of multiplication in some finite fields
• 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
• On the bilinear complexity of the multiplication in small finite fields
• Lectures on the theory of algebraic functions of one variable
• Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
• Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
• On tame towers over finite fields
• Algebraic complexities and algebraic curves over finite fields

This page was built for publication: An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields