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

DOI10.1016/J.CRMA.2015.12.001MaRDI QIDQ512336zbMATH OpenOpenAlexFDO

Authors Kévin Atighehchi, S. Ballet, Alexis Bonnecaze, Robert Rolland

Publication date 24 February 2017

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Recommendations

• Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
• An improvement of the construction of the D. V. and G. V. Chudnovsky algorithm for multiplication in finite fields
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
• On the scalar complexity of Chudnovsky\(^2\) multiplication algorithm in finite fields
• Optimization of the scalar complexity of Chudnovsky\(^2\) multiplication algorithms in finite fields

Cites work

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

Cited in

(4)

• Dense Arithmetic over Finite Fields with the CUMODP Library
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
• Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512336)