M. Car, Théorèmes de densité dans F q [x], Acta Arith, vol.48, pp.145-165, 1987.

L. Dong, Z. Gao, and D. Panario, Enumeration of Decomposable Combinatorial Structures with Restricted Patterns, Annals of Combinatorics, vol.121, issue.1-2
DOI : 10.1007/s00026-009-0008-y

P. Flajolet, X. Gourdon, and D. Panario, The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields, Journal of Algorithms, vol.40, issue.1, pp.37-81, 2001.
DOI : 10.1006/jagm.2001.1158

URL : https://hal.archives-ouvertes.fr/inria-00073319

P. Flajolet and A. Odlyzko, Singularity Analysis of Generating Functions, SIAM Journal on Discrete Mathematics, vol.3, issue.2, pp.216-240, 1990.
DOI : 10.1137/0403019

URL : https://hal.archives-ouvertes.fr/inria-00075725

P. Flajolet and M. Soria, Gaussian limiting distributions for the number of components in combinatorial structures, Journal of Combinatorial Theory, Series A, vol.53, issue.2, pp.165-182, 1990.
DOI : 10.1016/0097-3165(90)90056-3

URL : https://hal.archives-ouvertes.fr/inria-00075742

V. Goncharov, Sur la distribution des cycles dans une permutation, Acad. Sci. URSS(N.S.), vol.35, pp.267-269, 1942.

V. Goncharov, On the field of combinatorial analysis, Amer. Math. Soc. Transl, vol.2, pp.1-46, 1962.

X. Gourdon, Largest component in random combinatorial structures, Discrete Mathematics, vol.180, issue.1-3, pp.185-209, 1998.
DOI : 10.1016/S0012-365X(97)00115-5

URL : https://hal.archives-ouvertes.fr/inria-00074131

A. Knopfmacher and R. Warlimont, Distinct degree factorizations for polynomials over a finite field, Transactions of the American Mathematical Society, vol.347, issue.6, pp.2235-2243, 1995.
DOI : 10.1090/S0002-9947-1995-1277121-X

A. Knopfmacher and R. Warlimont, Counting permutations and polynomials with a restricted factorization pattern, Australasian Journal of Combinatorics, vol.13, pp.151-162, 1996.

A. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Lecture Notes in Computer Science, vol.209, pp.224-314, 1985.
DOI : 10.1007/3-540-39757-4_20

D. Panario, R. , and B. , Analysis of Ben-Or's polynomial irreducibility test. Random Struct, Algorithms, vol.13, pp.439-456, 1998.

D. Panario, R. , and B. , Smallest components in decomposable structures: Exp-log class, Algorithmica, vol.14, issue.2, pp.205-226, 2001.
DOI : 10.1007/BF02679619

J. J. Quisquater and J. P. Delescaille, How easy is collision search? Application to DES, Lecture Notes in Computer Science, vol.434, pp.429-433, 1989.
DOI : 10.1007/3-540-46885-4_43

R. Stanley, Generating functions, Studies in, pp.100-141, 1978.