๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Factoring polynomials using binary representations of finite fields

โœ Scribed by Ganz, J.


Book ID
114540591
Publisher
IEEE
Year
1997
Tongue
English
Weight
857 KB
Volume
43
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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 Polynomials Over Finite Fields
โœ Joachim von zur Gathen; Daniel Panario ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 452 KB

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.