135 search results - page 7 / 27 » Improved dense multivariate polynomial factorization algorit... |
146
click to vote
ICPPW
2005
IEEE
15 years 11 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,...
140
Voted
ISSAC
2009
Springer
16 years 11 days 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...
203
Voted
PKC
2011
Springer
14 years 8 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...
181
Voted
ANTS
2010
Springer
15 years 9 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...
142
click to vote
FOCS
2008
IEEE
16 years 8 days 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...