Testing polynomial irreducibility without GCDs

Joerg Arndt (1)

1 CACAO - Curves, Algebra, Computer Arithmetic, and so On

We determine classes of degrees where testing irreducibility for univariate polynomials over finite fields can be done without any GCD computation.

Mots clés: finite fields; irreducible polynomial; GCD

Domaines: Algorithme et structure de données [cs.DS]

Joerg Arndt. Testing polynomial irreducibility without GCDs. [Research Report] RR-6542, INRIA. 2008, pp.6. ⟨inria-00281614v2⟩