|
|||||
|
|
Polynomial factorization over |
|
| Authors: | Joachim von zur Gathen Jü rgen Gerhard |
| Institution: | Fachbereich 17 Mathematik-Informatik, Universität Paderborn, D-33095 Paderborn, Germany ; Fachbereich 17 Mathematik-Informatik, Universität Paderborn, D-33095 Paderborn, Germany |
| Abstract: | We describe algorithms for polynomial factorization over the binary field  , and their implementation. They allow polynomials of degree up to  to be factored in about one day of CPU time, distributing the work on two processors. |
| Keywords: | Fast algorithms finite fields Frobenius automorphism polynomial factorization |
| 点击此处可从《Mathematics of Computation》浏览原始摘要信息 | |
| 点击此处可从《Mathematics of Computation》下载免费的PDF全文 | |