Finite polynomial orbits in quadratic rings
✍ Scribed by Roman Marszałek; Władyslaw Narkiewicz
- Publisher
- Springer US
- Year
- 2006
- Tongue
- English
- Weight
- 382 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1382-4090
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Convolution algorithms for polynomial multiplication are well known, as is the use of Residue Number Systems and the Chinese Remainder Theorem. This paper discusses how these techniques may be used to perform polynomial arithmetic over very large rings or finite fields. The algorithm is practical an
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