An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)

DOI10.1007/BF01810851zbMath0743.68083OpenAlexW2017419566MaRDI QIDQ1177865

Mohammad Amin Shokrollahi, Ulrich Baum

Publication date: 26 June 1992

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01810851

zbMATH Keywords

elliptic curvesfinite fieldsinterpolation algorithmsbilinear complexityRiemann- Roch theorem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (11)

An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields ⋮ A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line ⋮ Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields ⋮ On the tensor rank of multiplication in any extension of \(\mathbb F_2\) ⋮ Efficient randomized generation of optimal algorithms for multiplication in certain finite fields ⋮ On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields ⋮ Boosting the margin: a new explanation for the effectiveness of voting methods ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry ⋮ New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields ⋮ Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields ⋮ Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15

Uses Software

• GAP

Cites Work

• Unnamed Item
• Lectures on the complexity of bilinear problems
• Elliptic codes over fields of characteristic 2
• On multiplication in algebraic extension 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
• Algebraic complexities and algebraic curves over finite fields

This page was built for publication: An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)