On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields
From MaRDI portal
Publication:2175409
DOI10.1007/978-3-030-21363-3_6zbMath1456.11235OpenAlexW2952451347MaRDI QIDQ2175409
Alexis Bonnecaze, Stéphane 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
Arithmetic theory of algebraic function fields (11R58) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
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 finite extensions of finite fields and related issues in algebraic geometry