Efficient algorithms are presented for factoring polynomials in the skew-polynomial ring F[x; Ο], a non-commutative generalization of the usual ring of polynomials F[x], where F is a finite field and Ο: F β F is an automorphism (iterated Frobenius map). Applications include fast functional decomposi
Sieve methods for polynomial rings over finite fields
β Scribed by William A Webb
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 430 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
We analyze the problem of finding the roots of an arbitrary polynomial over a finite field (equivalent to factoring an arbitrary polynomial over the field) and propose a deterministic approach which leads to a combinatorial problem whose satisfactory solution would yield a factoring method which is