135 search results - page 7 / 27 » Improved dense multivariate polynomial factorization algorit... |
ICPPW
2005
IEEE
14 years 1 months ago
2005
IEEE
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
PKC
2011
Springer
12 years 10 months ago
2011
Springer
We investigate the security of a generalization of HFE (multivariate and odd-characteristic variants). First, we propose an improved version of the basic Kipnis-Shamir key recovery...
ANTS
2010
Springer
13 years 11 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...