/*============================================================================= This file is part of FLINT. FLINT is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. FLINT is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with FLINT; if not, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA =============================================================================*/ /****************************************************************************** Copyright (C) 2012 Lina Kulakova Copyright (C) 2013 Martin Lee ******************************************************************************/ #undef ulong #define ulong ulongxx/* interferes with system includes */ #include #undef ulong #include #define ulong mp_limb_t #include "fmpz_mod_poly.h" void fmpz_mod_poly_factor_distinct_deg(fmpz_mod_poly_factor_t res, const fmpz_mod_poly_t poly, slong * const *degs) { fmpz_mod_poly_t f, g, v, vinv, reducedH0, tmp; fmpz_mod_poly_t *h, *H, *I; slong i, j, l, m, n, index, d; fmpz_t p; fmpz_mat_t HH, HHH; double beta; fmpz_init(p); fmpz_set(p, &poly->p); fmpz_mod_poly_init(v, p); fmpz_mod_poly_make_monic(v, poly); n = fmpz_mod_poly_degree(poly); if (n == 1) { fmpz_mod_poly_factor_insert(res, v, 1); (*degs)[0]= 1; fmpz_mod_poly_clear(v); return; } beta = 0.5 * (1. - (log(2) / log(n))); l = ceil(pow(n, beta)); m = ceil(0.5 * n / l); /* initialization */ fmpz_mod_poly_init(f, p); fmpz_mod_poly_init(g, p); fmpz_mod_poly_init(vinv, p); fmpz_mod_poly_init(reducedH0, p); fmpz_mod_poly_init(tmp, p); if (!(h = flint_malloc((2 * m + l + 1) * sizeof(fmpz_mod_poly_struct)))) { flint_printf("Exception (fmpz_mod_poly_factor_distinct_deg):\n"); flint_printf("Not enough memory.\n"); abort(); } H = h + (l + 1); I = H + m; for (i = 0; i < l + 1; i++) fmpz_mod_poly_init(h[i], p); for (i = 0; i < m; i++) { fmpz_mod_poly_init(H[i], p); fmpz_mod_poly_init(I[i], p); } fmpz_mod_poly_reverse(vinv, v, v->length); fmpz_mod_poly_inv_series_newton(vinv, vinv, v->length); /* compute baby steps: h[i]=x^{p^i}mod v */ fmpz_mod_poly_set_coeff_ui(h[0], 1, 1); fmpz_mod_poly_powmod_x_fmpz_preinv(h[1], p, v, vinv); if (fmpz_sizeinbase(p, 2) > ((n_sqrt (v->length - 1) + 1) * 3) / 4) { fmpz_mat_init(HH, n_sqrt (v->length - 1) + 1, v->length - 1); fmpz_mod_poly_precompute_matrix(HH, h[1], v, vinv); for (i = 2; i < l + 1; i++) fmpz_mod_poly_compose_mod_brent_kung_precomp_preinv(h[i], h[i - 1], HH, v, vinv); fmpz_mat_clear(HH); } else { for (i = 2; i < l + 1; i++) fmpz_mod_poly_powmod_fmpz_binexp_preinv(h[i], h[i - 1], p, v, vinv); } /* compute coarse distinct-degree factorisation */ index= 0; fmpz_mod_poly_set(H[0], h[l]); fmpz_mod_poly_set(reducedH0, H[0]); fmpz_mat_init(HH, n_sqrt (v->length - 1) + 1, v->length - 1); fmpz_mod_poly_precompute_matrix(HH, reducedH0, v, vinv); d = 1; for (j = 0; j < m; j++) { /* compute giant steps: H[i]=x^{p^(li)}mod v */ if (j > 0) { if (I[j - 1]->length > 1) { _fmpz_mod_poly_reduce_matrix_mod_poly(HHH, HH, v); fmpz_mat_clear(HH); fmpz_mat_init_set(HH, HHH); fmpz_mat_clear(HHH); fmpz_mod_poly_rem(reducedH0, reducedH0, v); fmpz_mod_poly_rem(tmp, H[j - 1], v); fmpz_mod_poly_compose_mod_brent_kung_precomp_preinv(H[j], tmp, HH, v, vinv); } else fmpz_mod_poly_compose_mod_brent_kung_precomp_preinv(H[j], H[j - 1], HH, v, vinv); } /* compute interval polynomials */ fmpz_mod_poly_set_coeff_ui(I[j], 0, 1); for (i = l - 1; (i >= 0) && (2 * d <= v->length - 1); i--, d++) { fmpz_mod_poly_rem(tmp, h[i], v); fmpz_mod_poly_sub(tmp, H[j], tmp); fmpz_mod_poly_mulmod_preinv(I[j], tmp, I[j], v, vinv); } /* compute F_j=f^{[j*l+1]} * ... * f^{[j*l+l]} */ /* F_j is stored on the place of I_j */ fmpz_mod_poly_gcd(I[j], v, I[j]); if (I[j]->length > 1) { fmpz_mod_poly_remove(v, I[j]); fmpz_mod_poly_reverse(vinv, v, v->length); fmpz_mod_poly_inv_series_newton(vinv, vinv, v->length); } if (v->length-1 < 2 * d) { break; } } if (v->length > 1) { fmpz_mod_poly_factor_insert(res, v, 1); (*degs)[index++] = v->length - 1; } /* compute fine distinct-degree factorisation */ for (j = 0; j < m; j++) { if (I[j]->length - 1 > (j + 1)*l || j == 0) { fmpz_mod_poly_set(g, I[j]); for (i = l - 1; i >= 0 && (g->length > 1); i--) { /* compute f^{[l*(j+1)-i]} */ fmpz_mod_poly_sub(tmp, H[j], h[i]); fmpz_mod_poly_gcd(f, g, tmp); if (f->length > 1) { /* insert f^{[l*(j+1)-i]} into res */ fmpz_mod_poly_make_monic(f, f); fmpz_mod_poly_factor_insert(res, f, 1); (*degs)[index++] = l * (j + 1) - i; fmpz_mod_poly_remove(g, f); } } } else if (I[j]->length > 1) { fmpz_mod_poly_make_monic(I[j], I[j]); fmpz_mod_poly_factor_insert(res, I[j], 1); (*degs)[index++] = I[j]->length - 1; } } /* cleanup */ fmpz_clear(p); fmpz_mod_poly_clear(f); fmpz_mod_poly_clear(g); fmpz_mod_poly_clear(reducedH0); fmpz_mod_poly_clear(v); fmpz_mod_poly_clear(vinv); fmpz_mod_poly_clear(tmp); fmpz_mat_clear(HH); for (i = 0; i < l + 1; i++) fmpz_mod_poly_clear(h[i]); for (i = 0; i < m; i++) { fmpz_mod_poly_clear(H[i]); fmpz_mod_poly_clear(I[i]); } flint_free(h); }