The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields

Philippe Flajolet
  • Function : Author
  • PersonId : 829512
Xavier Gourdon
  • Function : Author
Daniel Panario
  • Function : Author

Abstract

A unified treatment of parameters relevant to factoring polynomials over finite fields is given. The framework is based on generating functions for describing parameters of interest and on singularity analysis for extracting asymptotic values. An outcome is a complete analysis of the standard polynomial factorization chain that is based on elimination of repeated factors, distinct degree factorization, and equal degree separation. Several basic statistics on polynomials over finite fields are obtained in the course of the analysis.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3370.pdf (508.73 Ko) Télécharger le fichier

Dates and versions

inria-00073319 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073319 , version 1

Cite

Philippe Flajolet, Xavier Gourdon, Daniel Panario. The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields. [Research Report] RR-3370, INRIA. 1998. ⟨inria-00073319⟩
75 View
209 Download

Share

Gmail Facebook X LinkedIn More