## The Complete Analysis of a Polynomial Factorization Algorithm Over Finite Fields (2001)

### Cached

### Download Links

- [pauillac.inria.fr]
- [algo.inria.fr]
- [ftp.inria.fr]
- DBLP

### Other Repositories/Bibliography

Citations: | 14 - 3 self |

### BibTeX

@MISC{Flajolet01thecomplete,

author = {Philippe Flajolet and Xavier Gourdon and Daniel Panario},

title = {The Complete Analysis of a Polynomial Factorization Algorithm Over Finite Fields},

year = {2001}

}

### OpenURL

### Abstract

This paper derives basic probabilistic properties of random polynomials over finite fields that are of interest in the study of polynomial factorization algorithms. We show that the main characteristics of random polynomial can be treated systematically by methods of "analytic combinatorics" based on the combined use of generating functions and of singularity analysis. Our object of study is the classical factorization chain which is described in Fig. 1 and which, despite its simplicity, does not appear to have been totally analysed so far. In this paper, we provide a complete average-case analysis.