most citedGradual sub-lattice reduction and a new complexity for factoring polynomials

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.SC2010★ 1 cited

Gradual sub-lattice reduction and a new complexity for factoring polynomials

Mark Van Hoeij, Andrew Novocin

We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type s…