Name
Abstract | ||
|---|---|---|
In this article we will discuss a mostly theoretical framework for solving zero-dimensional polynomial systems. Complexity bounds are obtained for solving such systems using a new parameter, called the last fall degree, which does not depend on the choice of a monomial order. The method is similar to certain MutantXL algorithms, but our abstract formulation has advantages. For example, we can prove that the cryptographic systems multi-HFE and HFE are insecure. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.jsc.2017.08.002 | Journal of Symbolic Computation |
Keywords | Field | DocType |
13P10,13P15 | Monomial order,Discrete mathematics,Combinatorics,Finite field,Cryptographic protocol,Polynomial,Cryptography,Upper and lower bounds,Cardinality,Gröbner basis,Mathematics | Journal |
Volume | ISSN | Citations |
87 | 0747-7171 | 2 |
PageRank | References | Authors |
0.43 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ming-Deh A. Huang | 1 | 718 | 133.28 |
| Michiel Kosters | 2 | 15 | 2.44 |
| Yun Yang | 3 | 76 | 9.80 |
| Sze Ling Yeo | 4 | 40 | 8.76 |