Factoring high-degree polynomials over F2 with Niederreiter's algorithm on the IBM SP2

Mathematics of Computation

Volumn 68, Issue 226, 1999, Pages 869-880

  Roelse, Peter ^a,b  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

^b PHILIPS RESEARCH LABORATORIES   (Germany)

Author keywords

Finite fields; Parallel computing; Polynomial factorization

Indexed keywords

EID: 0033426088     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0025-5718-99-01008-x     Document Type: Article

References (19)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974. MR 54:1706
2. E. Bach and J. Shallit, Algorithmic Number Theory - Volume 1: Efficient Algorithms, The MIT Press, 1996. MR 97e:11157
3. D.G. Cantor, On arithmetical algorithms over finite fields, J. Combin. Theory Ser. A 50, (1989), 285-300. MR 90f:11100
4. K. Dowd, High Performance Computing, O'Reilly & Associates Inc., 1993.
5. A. Diaz, E. Kaltofen and V. Pan, Algebraic algorithms, The Computer Science and Engineering Handbook (A.B. Tucker, ed.), CRC Press, 1997, pp. 226-249.
6. P. Fleischmann and P. Roelse, Comparative implementations of Berlekamp's and Niederreiter's polynomial factorization algorithms, Finite Fields and their Applications (S. Cohen and H. Niederreiter, eds.), Cambridge University Press, 1996, pp. 73-84. MR 98a:12009
7. 2, Proc. ISSAC '96, ACM Press, 1996, pp. 1-9.
8. K.O. Geddes, S.R. Czapor and G. Labahn, Algorithms for Computer Algebra, Kluwer Academic Publishers, 1992. MR 96a:68049
9. q: ein Vergleich neuerer Verfahren, Master's thesis, University of Erlangen-Nürnberg, 1994.
10. IBM, AIX Version 3.2 for RISC System/6000: Optimization and Tuning Guide for Fortran, C, and C++, IBM Manual, 1993.
11. E. Kaltofen and A. Lobo, Factoring high-degree polynomials by the black box Berlekamp algorithm, Proc. ISSAC '94 (J. von zur Gathen and M. Giesbrecht, eds.), ACM Press, 1994, pp. 90-98.
12. A. Karatsuba and Y. Ofman, Multiplication of multidigit numbers on automata, Soviet Phys. Dokl. 7 (1963), 595-596.
13. H. Niederreiter, New deterministic factorization algorithms for polynomials over finite fields, Contemp. Math. 168 (1994), 251-268. MR 95f:11100
14. D. Reischert, Schnelle Multiplikation von Polynomen über GF(2) und Anwendungen, Master's thesis, University of Bonn, 1995.
15. 2, Preprint, 1996.
16. V. Shoup, A new polynomial factorization algorithm and its implementation, J. Symbolic Comput. 20 (1995), 363-397. MR 97d:12011
17. V. Strassen, The computational complexity of continued fractions, SIAM J. Comput. 12 (1983), 1-27. MR 84b:12004
18. M. Weller, Parallel Gaussian elimination over small finite fields, Parallel and Distributed Computing Systems, Proc. of the ISCA International Conference (K. Yetongnon and S. Hariri, eds.), 1996, 56-63.
19. D.Y.Y. Yun, On square-free decomposition algorithms, Proc. ACM Symp. Symbolic and Algebraic Comput. (R.D. Jenks, ed.). 1976, pp. 26-35.