A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line

DOI10.1090/conm/779/15668zbMath1506.11152OpenAlexW4383993705MaRDI QIDQ5880200

Stéphane Ballet, Bastien Pacifico, Alexis Bonnecaze

Publication date: 7 March 2023

Published in: Arithmetic, Geometry, Cryptography, and Coding Theory 2021 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/conm/779/15668

zbMATH Keywords

finite fieldsmultiplicative complexityChudnovsky-type algorithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
• The Magma algebra system. I: The user language
• Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15
• Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields
• On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields
• Fast multiplication of large numbers
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
• Fast Polynomial Multiplication over F _{2 60}
• Algebraic Function Fields and Codes
• Faster Integer Multiplication
• Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)
• Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
• Algebraic complexities and algebraic curves over finite fields

This page was built for publication: A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line