28607 articles – 22094 references  [version française]

inria-00281614, version 2

Testing polynomial irreducibility without GCDs

Joerg Arndt (Author to contact preferably) a, 1

N° RR-6542 (2008)

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

  • a –  Australian National University
  • 1:  CACAO (INRIA Lorraine - LORIA)
  • CNRS : UMR7503 – INRIA – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
  • Collaboration : Australian National University and CACAO
  • Domain : Computer Science/Data Structures and Algorithms
  • Keywords : finite fields – irreducible polynomial – GCD
  • Internal note : RR-6542
  • Available versions :  v1 (2008-05-23) v2 (2008-05-26)
 
  • inria-00281614, version 2
  • http://hal.inria.fr/inria-00281614
  • oai:hal.inria.fr:inria-00281614
  • From: Paul Zimmermann <>
  • Submitted on: Monday, 26 May 2008 09:40:29
  • Updated on: Monday, 23 June 2008 17:09:03