Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15

DOI10.1016/S0022-4049(01)00137-2zbMath1069.11050MaRDI QIDQ1612116

Stéphane Ballet

Publication date: 22 August 2002

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (8)

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 multiplication in finite fields ⋮ On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry ⋮ Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields ⋮ Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic function fields and codes
• An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
• On multiplication in algebraic extension 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
• Algebraic complexities and algebraic curves over finite fields

This page was built for publication: Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15