Fast Multiplication for Skew Polynomials

DOI10.1145/3087604.3087617zbMath1457.68324arXiv1702.01665OpenAlexW2586406865MaRDI QIDQ5119925

Xavier Caruso, Jérémy Le Borgne

Publication date: 9 September 2020

Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.01665

zbMATH Keywords

finite fieldsGabidulin codesskew polynomialsfast multiplication algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Skew fields, division rings (12E15)

Related Items (5)

Non-commutative ring learning with errors from cyclic algebras ⋮ Skew-polynomial-sparse matrix multiplication ⋮ Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology ⋮ Counting invariant subspaces and decompositions of additive polynomials ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding

This page was built for publication: Fast Multiplication for Skew Polynomials