首页 | 本学科首页   官方微博 | 高级检索  
     


Polynomial factorization over
Authors:Joachim von zur Gathen    rgen Gerhard.
Affiliation: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 ${mathbb F}_2$, and their implementation. They allow polynomials of degree up to $250,000$ 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》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号