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
โฆ LIBER โฆ
Direct factors of polynomial rings over finite fields
โ Scribed by J Knopfmacher
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 223 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Factoring in Skew-polynomial Rings over
โ
M. Giesbrecht
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 716 KB
Factoring polynomials over finite fields
โ
Lajos Rรณnyai
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 529 KB
Sieve methods for polynomial rings over
โ
William A Webb
๐
Article
๐
1983
๐
Elsevier Science
๐
English
โ 430 KB
Factoring Polynomials over Special Finit
โ
Eric Bach; Joachim von zur Gathen; Hendrik W. Lenstra Jr.
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 227 KB
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 Dickson Polynomials over Finit
โ
Manjul Bhargava; Michael E. Zieve
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 105 KB
Factoring multivariate polynomials over
โ
A.K. Lenstra
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 836 KB