A new faster algorithm for factoring skew polynomials over finite fields - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Symbolic Computation Année : 2017

A new faster algorithm for factoring skew polynomials over finite fields

Résumé

In this paper, we provide an algorithm for the factorization of skew polynomials over finite fields. It is faster than the previously known algorithm, which was due to Giesbrecht (1998). There are two main improvements. The first one is obtained through a careful study of the structure of the quotients of a skew polynomial ring, using theoretical results relating skew polynomial rings and Azumaya algebras. The second improvement is provided by giving faster sub-algorithms for the arithmetic in skew polynomial rings, such as multiplication, division, and extended Euclidean division.

Dates et versions

hal-01332871 , version 1 (16-06-2016)

Identifiants

Citer

Xavier Caruso, Jérémy Le Borgne. A new faster algorithm for factoring skew polynomials over finite fields. Journal of Symbolic Computation, 2017, 79 (2), pp.411-443. ⟨10.1016/j.jsc.2016.02.016⟩. ⟨hal-01332871⟩
136 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More