On the bilinear complexity of the multiplication in small finite fields

DOI10.1016/J.CRMA.2006.06.030MaRDI QIDQ2506478zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Multiplication in small finite fields using elliptic curves
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• On the bounds of the bilinear complexity of multiplication in some finite fields
• Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
• On multiplication in finite fields

Cites work

• Algebraic complexities and algebraic curves over finite fields
• Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• scientific article; zbMATH DE number 3937328 (Why is no real title available?)
• scientific article; zbMATH DE number 125907 (Why is no real title available?)
• On multiplication in algebraic extension fields
• On the rank of certain finite fields
• Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves

Cited in

(12)

• 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\)
• An improvement of bilinear complexity bounds in some finite fields.
• Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
• Normal bases from 1-dimensional algebraic groups
• On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
• Elliptic periods for finite fields
• Multiplication in small finite fields using elliptic curves
• On "A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits"
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
• An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
• On the tensor rank of the multiplication in the finite fields

This page was built for publication: On the bilinear complexity of the multiplication in small finite fields

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