On the scalar complexity of Chudnovsky^2 multiplication algorithm in finite fields

DOI10.1007/978-3-030-21363-3_6zbMATH Open1456.11235OpenAlexW2952451347MaRDI QIDQ2175409FDOQ2175409

Alexis Bonnecaze, S. Ballet, Thanh-Hung Dang

Publication date: 29 April 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-21363-3_6

Recommendations

• Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in 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
• Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
• Finding optimal Chudnovsky-Chudnovsky multiplication algorithms
• 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
• An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
• Chaining multiplications in finite fields with Chudnovsky-type algorithms and tensor rank of the \(k\)-multiplication
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)

zbMATH Keywords

finite fieldalgebraic complexityalgebraic function fieldscalar complexity

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cited In (5)

• Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
• A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line
• 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
• Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields

This page was built for publication: On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields

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