Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm

DOI10.1016/j.crma.2015.12.001zbMath1429.12001OpenAlexW2274994815MaRDI QIDQ512336

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

Publication date: 24 February 2017

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2015.12.001

zbMATH Keywords

bilinear multiplicationsChudnovsky multiplication algorithmparallelized computations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite fields (field-theoretic aspects) (12E20) Field arithmetic (12E30) Computational methods for problems pertaining to field theory (12-08)

Related Items (1)

On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry

Cites Work

• Efficient and optimal exponentiation in finite fields
• Matrix multiplication via arithmetic progressions
• Algorithms for exponentiation in finite fields
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• Elliptic periods for finite fields
• Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
• Algebraic complexities and algebraic curves over finite fields

This page was built for publication: Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm