Testing polynomial irreducibility without GCDs

Joerg Arndt 1, *
* Corresponding author
1 CACAO - Curves, Algebra, Computer Arithmetic, and so On
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We determine classes of degrees where testing irreducibility for univariate polynomials over finite fields can be done without any GCD computation.
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/inria-00281614
Contributor : Paul Zimmermann <>
Submitted on : Monday, May 26, 2008 - 9:40:29 AM
Last modification on : Thursday, January 11, 2018 - 6:21:04 AM
Long-term archiving on : Friday, November 25, 2016 - 9:54:50 PM

File

arndt-pseudo-irred-RR.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00281614, version 2

Collections

Citation

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

Share

Metrics

Record views

165

Files downloads

159