Factoring multivariate polynomials over finite fields

Authors:
Arjen K. Lenstra
Affiliations:
-
Venue:
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Year:
1983

Citing 0
Cited 3

Interpolation of sparse multivariate polynomials over large finite fields with applications

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Exact polynomial factorization by approximate high degree algebraic numbers

Proceedings of the 2009 conference on Symbolic numeric computation
A note on Gao's algorithm for polynomial factorization

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 IFq.