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.045zbMATH Open1099.11073OpenAlexW2068589874MaRDI QIDQ818142FDOQ818142

Authors: S. 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

Recommendations

• On multiplication in finite fields
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
• Finding optimal Chudnovsky-Chudnovsky multiplication algorithms
• Multiplication algorithm in a finite field and tensor rank of the multiplication.

zbMATH Keywords

algorithmsalgebraic function fieldsfinite fieldsalgebraic curvesbilinear complexity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On tame towers over finite fields
• Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\)
• A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
• Title not available (Why is that?)
• Algebraic complexities and algebraic curves over finite fields
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• Title not available (Why is that?)
• Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
• On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_2\)
• Lectures on the theory of algebraic functions of one variable
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
• On multiplication in algebraic extension fields
• An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
• 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
• On the bilinear complexity of the multiplication in small finite fields

Cited In (21)

• 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
• Normal bases from 1-dimensional algebraic groups
• Title not available (Why is that?)
• An improvement of bilinear complexity bounds in some finite fields.
• On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation
• Elliptic periods for 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
• On the tensor rank of the multiplication in the finite fields
• Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
• On multiplication in finite fields
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• Trisymmetric multiplication formulae in finite fields
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
• Finding optimal Chudnovsky-Chudnovsky multiplication algorithms
• Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of \(\mathbb F_q\)
• Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
• Title not available (Why is that?)
• Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818142)