Some algorithms for skew polynomials over finite fields

arXiv1212.3582MaRDI QIDQ6238034FDOQ6238034

Publication date: 14 December 2012

Abstract: In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise description of quotients of skew polynomial rings by a left principal ideal, using results relating skew polynomial rings to Azumaya algebras. We use this description to give a new factorization algorithm for skew polynomials, and to give other algorithms related to factorizations of skew polynomials, like counting the number of factorizations as a product of irreducibles.

This page was built for publication: Some algorithms for skew polynomials over finite fields

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