Factoring multivariate polynomials over finite fields

This paper describes an algorithm for the factorization of multivariate polynomials with coefficients in a finite field that is polynomial-time in the degrees of the polynomial to be factored. The algorithm makes use of a new basis reduction algorithm for lattices over a finite field.


Published in:
Journal of Computer and System Sciences, 30, 2, 235 - 248
Year:
1983
ISSN:
00220000
Keywords:
Laboratories:




 Record created 2010-06-24, last modified 2018-03-17

Postprint:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)