Testing polynomial irreducibility without GCDs - INRIA - Institut National de Recherche en Informatique et en Automatique Access content directly
Reports (Research Report) Year : 2008

Testing polynomial irreducibility without GCDs

Joerg Arndt
  • Function : Correspondent author
  • PersonId : 849253

Connectez-vous pour contacter l'auteur
Curves, Algebra, Computer Arithmetic, and so On

Abstract

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

Domains

Data Structures and Algorithms [cs.DS]
Fichier principal
Vignette du fichier
arndt-pseudo-irred-RR.pdf (143.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Paul Zimmermann  : Connect in order to contact the contributor

https://inria.hal.science/inria-00281614

Submitted on : Friday, May 23, 2008-2:46:20 PM

Last modification on : Friday, March 24, 2023-2:52:50 PM

Long-term archiving on: Friday, September 28, 2012-2:56:11 PM

Download

Dates and versions

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

Identifiers

  • HAL Id : inria-00281614 , version 1

Cite

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

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite
95 View
229 Download

Share

Gmail Facebook X LinkedIn More