We exhibit a deterministic algorithm for factoring polynomials in one variable over "nite "elds. It is e$cient only if a positive integer k is known for which I (p) is built up from small prime factors; here I denotes the kth cyclotomic polynomial, and p is the characteristic of the "eld. In the cas
Factoring multivariate polynomials over finite fields
โ Scribed by A.K. Lenstra
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 836 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This survey reviews several algorithms for the factorization of univariate polynomials over finite fields. We emphasize the main ideas of the methods and provide an up-to-date bibliography of the problem.
We describe an efficient new algorithm for factoring a polynomial ฮฆ(x) over a field k that is complete with respect to a discrete prime divisor. For every irreducible factor ฯ(x) of ฮฆ(x) this algorithm returns an integral basis for k[x]/ฯ(x)k[x] over k.
A recently discovered family of indecomposable polynomials of nonprime power degree over \(\mathbb{F}_{2}\) (which include a class of exceptional polynomials) is set against the background of the classical families and their monodromy groups are obtained without recourse to the classification of fin