Testing polynomial irreducibility without GCDs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

Testing polynomial irreducibility without GCDs

Abstract

We determine classes of degrees where testing irreducibility for univariate polynomials over finite fields can be done without any GCD computation.
Fichier principal
Vignette du fichier
arndt-pseudo-irred-RR.pdf (214.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00281614 , version 1 (23-05-2008)
inria-00281614 , version 2 (26-05-2008)

Identifiers

  • HAL Id : inria-00281614 , version 2

Cite

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

Share

Gmail Facebook X LinkedIn More