New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

Authors:
Grégoire Lecerf
Affiliations:
Université de Versailles Saint-Quentin, Laboratoire de Mathématiques (UMR 8100 CNRS), 45 Avenue des États-Unis, 78035, Versailles, France
Venue:
Applicable Algebra in Engineering, Communication and Computing
Year:
2010

Citing 0
Cited 5

A lifting and recombination algorithm for rational factorization of sparse polynomials

Journal of Complexity
A note on Gao's algorithm for polynomial factorization

Theoretical Computer Science
Algebraic cryptanalysis of the PKC’2009 algebraic surface cryptosystem

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Extracting sparse factors from multivariate integral polynomials

Journal of Symbolic Computation
Factoring bivariate polynomials using adjoints

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel lifting technique. For the dense bi-degree polynomial representation, the costs of our recombination algorithms are essentially sub-quadratic.