Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms

DOI10.1007/978-3-319-16277-5_3zbMath1400.11163OpenAlexW172268928MaRDI QIDQ2949471

Matthieu Rambaud

Publication date: 1 October 2015

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-16277-5_3

zbMATH Keywords

tensor rankoptimal algorithmsfinite field arithmeticelliptic modular curvesChudnovsky-Chudnovsky interpolation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Related Items (2)

Improved method for finding optimal formulas for bilinear maps in a finite field ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry

Cites Work

• Unnamed Item
• Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
• Multiplication of polynomials modulo \(x^n\)
• Algebraic function fields and codes
• Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
• The Magma algebra system. I: The user language
• General tensor decomposition, moment matrices and applications
• Defining equations of modular curves
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
• Finding Optimal Formulae for Bilinear Maps
• Five, six, and seven-term Karatsuba-like formulae
• Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
• The M4RIE library for dense linear algebra over small fields with even characteristic
• Algebraic complexities and algebraic curves over finite fields

This page was built for publication: Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms