Chudnovsky-type algorithms over the projective line using generalized evaluation maps

DOI10.1007/978-3-031-33017-9_22zbMath1522.94035OpenAlexW4377082084MaRDI QIDQ6057235

Stéphane Ballet, Bastien Pacifico

Publication date: 4 October 2023

Published in: Codes, Cryptology and Information Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-33017-9_22

zbMATH Keywords

finite ground fieldalgebraic curvesGoppa codesmultiplicationcoding theoryalgebras over finite fieldsalgebraic geometrical methodsminimal algebraic complexities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Arithmetic theory of algebraic function fields (11R58) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• On multiplication in algebraic extension fields
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• Tower of algebraic function fields with maximal Hasse-Witt invariant and tensor rank of multiplication in any extension of \(\mathbb{F}_2\) and \(\mathbb{F}_3\)
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• On the tensor rank of multiplication in any extension of \(\mathbb F_2\)
• Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
• On symmetric algorithms for bilinear forms over finite fields
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
• Algebraic complexities and algebraic curves over finite fields
• Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity

This page was built for publication: Chudnovsky-type algorithms over the projective line using generalized evaluation maps