Question: mod 2 multivariate factorization

I have just found that the standard routine of Maple for performing mod 2 multivariate factorization, that is
Factor(p) mod 2
takes a very long computing time (I stopped after a long while) for the polynomial

p := K[4]*(K[4]^2*K[5]*K[6]^3*K[7]^2+K[4]*K[5]^2*K[6]^4*K[7]+K[4]^3*K[6]^2*K[7]^2+K[4]^2*K[5]*K[6]^3*K[7]+K[4]^2*K[5]*K[6]^2*K[7]^2+K[4]*K[5]^3*K[6]^3+K[5]^3*K[6]^4+K[4]^2*K[5]^3*K[6]+K[4]^2*K[5]^2*K[6]^2+K[4]^3*K[5]^2+K[4]^2*K[5]^3);

Note that the factorization of this polynomial is very fast on other computer algebra systems. Since mod 2 multivariate factorization (in fact, normalization of mod 2 multivariate rational functions) is essential for some algorithms that I'm currently implementing in Maple, I would ask if you know how to improve (bug, additional parameters?) the function Factor or if there are other functions, packages in Maple which implement a more feasible mod 2 multivariate factorization.

Many thanks in advance.

Please Wait...