Factoring multivariate polynomials over finite fields

70Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

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 Fq[Y]. © 1985.

Cite

CITATION STYLE

APA

Lenstra, A. K. (1985). Factoring multivariate polynomials over finite fields. Journal of Computer and System Sciences, 30(2), 235–248. https://doi.org/10.1016/0022-0000(85)90016-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free