Stronger bounds on the cost of computing Gröbner bases for HFE systems (Q820971)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stronger bounds on the cost of computing Gröbner bases for HFE systems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stronger bounds on the cost of computing Gröbner bases for HFE systems |
scientific article |
Statements
Stronger bounds on the cost of computing Gröbner bases for HFE systems (English)
0 references
29 September 2021
0 references
multivariate cryptography
0 references
Gröbner bases
0 references
HFE
0 references
(fake) Weil descent
0 references
last fall degree
0 references
solving degree
0 references
0 references
0.8485480546951294
0 references
0.8211139440536499
0 references
0.7954428195953369
0 references
0.7901363372802734
0 references
0.7900404334068298
0 references
