Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm

DOI10.1090/mcom/3230zbMath1392.12005OpenAlexW2602162520MaRDI QIDQ5270844

Kévin Atighehchi, Robert Rolland, Stéphane Ballet, Alexis Bonnecaze

Publication date: 3 July 2017

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/mcom/3230

Mathematics Subject Classification ID

Related Items (5)

Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields ⋮ Normal bases from 1-dimensional algebraic groups ⋮ Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry ⋮ Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient and optimal exponentiation in finite fields
• Algebraic function fields and codes
• On the existence of non-special divisors of degree \(g\) and \(g-1\) in algebraic function fields over \(\mathbb{F}_2\)
• Matrix multiplication via arithmetic progressions
• On multiplication in finite fields
• An improved parallel algorithm that computes the BFS numbering of a directed graph
• Processor-efficient exponentiation in finite fields
• The Magma algebra system. I: The user language
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• Algorithms for exponentiation in finite fields
• Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
• On the tensor rank of multiplication in any extension of \(\mathbb F_2\)
• Elliptic periods for finite fields
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
• On the existence of dimension zero divisors in algebraic function fields defined over F_q
• Efficient parallel exponentiation in using normal basis representations
• Algebraic complexities and algebraic curves over finite fields

This page was built for publication: Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm