On the bilinear complexity of the multiplication in small finite fields

DOI10.1016/j.crma.2006.06.030zbMath1140.11033OpenAlexW1998564767MaRDI QIDQ2506478

Jean Chaumine

Publication date: 28 September 2006

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2006.06.030

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20)

Related Items (6)

An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields ⋮ Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields ⋮ Normal bases from 1-dimensional algebraic groups ⋮ On the tensor rank of the multiplication in the 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
• On the rank of certain finite fields
• On multiplication in algebraic extension fields
• 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
• 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: On the bilinear complexity of the multiplication in small finite fields